Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
33 words
A method of creating a digital signature comprising the steps of: generating a random integer m; computing a point P 1 on an elliptic curve; computing an integer u using m and P1.
Claim 2
Independent Claim
33 words
A method of creating a digital signature comprising the steps of: generating a random integer m; computing a point P 1 on an elliptic curve; computing an integer u using m and P1.
Claim 3
Dependent Claim
17 words
The method of claim 1 wherein said elliptic curve has a starting point (X 1 , 1).
Claim 4
Dependent Claim
29 words
The method of claim 2 wherein said step of generating P 1 is accomplished by m°(X 1 , 1) and P1 has coordinates (X 1 , Y 1 ).
Claim 5
Dependent Claim
30 words
The method of claim 1 wherein said integer u is generated by m+our Pri*M(ciphertext, P) where ciphertext is the encrypted message to be sent and M is a hash function.
Claim 6
Dependent Claim
21 words
The method of claim 4 further including sending the pair (u, P 1 ) as a digital signature to a receiver.
Claim 7
Dependent Claim
70 words
The method of claim 2 further including a method of authenticating said digital signature comprising the steps of: using u, generating a point Q having coordinates (X, Y); using P 1 , generating a point P 2 having coordinates (X 2 , Y 2 ); testing the equality P 1 +P 2 =Q; identifying a signature as not authentic when the equality P 1 +P 2 =Q is not satisfied.
Claim 8
Dependent Claim
27 words
The method of claim 6 wherein said step of testing the equality P 1 +P 2 =Q; is performed without using Y 1 and Y 2 .
Claim 9
Dependent Claim
68 words
The method of claim 2 further including a method of authenticating said digital signature comprising the steps of: using u, generating a point Q having coordinates (X, Y); using P 1 , generating a point P 2 having coordinates (X 2 , Y 2 ); testing the equality P 1 +P 2 =Q; identifying a signature as authentic when the equality P 1 +P 2 =Q is satisfied.
Claim 10
Dependent Claim
27 words
The method of claim 8 wherein said step of testing the equality P 1 +P 2 =Q; is performed without using Y 1 and Y 2 .
Claim 11
Dependent Claim
84 words
An article of manufacture comprising: a computer usable medium having computer readable program code embodied therein for creating a digital signature, the computer readable program code in said article of manufacture comprising; computer readable program code configured to cause a computer to generate a random integer m; computer readable program code configured to cause a computer to compute a point P 1 on an elliptic curve; computer readable program code configured to cause a computer to compute an integer u using m and P1.
Claim 12
Dependent Claim
84 words
An article of manufacture comprising: a computer usable medium having computer readable program code embodied therein for creating a digital signature, the computer readable program code in said article of manufacture comprising; computer readable program code configured to cause a computer to generate a random integer m; computer readable program code configured to cause a computer to compute a point P 1 on an elliptic curve; computer readable program code configured to cause a computer to compute an integer u using m and P1.
Claim 13
Dependent Claim
19 words
The article of manufacture of claim 10 wherein said elliptic curve has a starting point (X 1 , 1).
Claim 14
Dependent Claim
31 words
The article of manufacture of claim 11 wherein said step of generating P 1 is accomplished by m°(X 1 , 1) and P1 has coordinates (X 1 , Y 1 ).
Claim 15
Dependent Claim
32 words
The article of manufacture of claim 10 wherein said integer u is generated by m+our Pri*M(ciphertext, P) where ciphertext is the encrypted message to be sent and M is a hash function.
Claim 16
Dependent Claim
23 words
The article of manufacture of claim 13 further including sending the pair (u, P 1 ) as a digital signature to a receiver.
Claim 17
Dependent Claim
101 words
The article of manufacture of claim 11 further including computer readable program code configured to authenticate said digital signature comprising the steps of: computer readable program code configured to use u, to generate a point Q having coordinates (X, Y); computer readable program code configured to use P 1 , to generate a point P 2 having coordinates (X 2 , Y 2 ); computer readable program code configured to test the equality P 1 +P 2 =Q; computer readable program code configured to identify a signature as not authentic when the equality P 1 +P 2 =Q is not satisfied.
Claim 18
Dependent Claim
29 words
The article of manufacture of claim 15 wherein said step of testing the equality P 1 +P 2 =Q; is performed without using Y 1 and Y 2 .
Claim 19
Dependent Claim
99 words
The article of manufacture of claim 11 further including computer readable program code configured to authenticate said digital signature comprising the steps of: computer readable program code configured to use u, to generate a point Q having coordinates (X, Y); computer readable program code configured to use P 1 , to generate a point P 2 having coordinates (X 2 , Y 2 ); computer readable program code configured to test the equality P 1 +P 2 =Q; computer readable program code configured to identify a signature as authentic when the equality P 1 +P 2 =Q is satisfied.
Claim 20
Dependent Claim
29 words
The article of manufacture of claim 17 wherein said step of testing the equality P 1 +P 2 =Q; is performed without using Y 1 and Y 2 .
Claim 21
Independent Claim
33 words
A system for creating a digital signature comprising: processing means for: generating a random integer m; computing a point P 1 on an elliptic curve; computing an integer u using m and P1.
Claim 22
Independent Claim
33 words
A system for creating a digital signature comprising: processing means for: generating a random integer m; computing a point P 1 on an elliptic curve; computing an integer u using m and P1.
Claim 23
Dependent Claim
17 words
The system of claim 19 wherein said elliptic curve has a starting point (X 1 , 1).
Claim 24
Dependent Claim
25 words
The system of claim 19 wherein P 1 is generated by m°(X 1 , 1) and P1 has coordinates (X 1 , Y 1 ).
Claim 25
Dependent Claim
30 words
The system of claim 19 wherein said integer u is generated by m+our Pri*M(ciphertext, P) where ciphertext is the encrypted message to be sent and M is a hash function.
Claim 26
Dependent Claim
21 words
The method of claim 22 further including sending the pair (u, P 1 ) as a digital signature to a receiver.
Claim 27
Dependent Claim
72 words
The system of claim 20 further including using said processing means to authenticate said digital signature wherein said processing means: generates a point Q having coordinates (X, Y) using u,; generates a point P 2 having coordinates (X 2 , Y 2 ) using P 1 ,; tests the equality P 1 +P 2 =Q; identifies a signature as not authentic when the equality P 1 +P 2 =Q is not satisfied.
Claim 28
Dependent Claim
24 words
The system of claim 24 wherein testing the equality P 1 +P 2 =Q; is performed without using Y 1 and Y 2 .
Claim 29
Dependent Claim
72 words
The system of claim 20 further including using said processing means to authenticate said digital signature wherein said processing means: generates a point Q having coordinates (X, Y) using u,; generates a point P 2 having coordinates (X 2 , Y 2 ) using P 1 ,; tests the equality P 1 +P 2 =Q; identifies a signature as not authentic when the equality P 1 +P 2 =Q is not satisfied.
Claim 30
Dependent Claim
25 words
The system of claim 26 wherein said testing the equality P 1 +P 2 =Q; is performed without using Y 1 and Y 2 .