A method of performing a cryptographic operation on a point in an elliptic curve cryptosystem using an elliptic curve. The method comprises the steps of obtaining information that uniquely identifies the elliptic curve and performing computations on the point to obtain the result of the cryptographic operation. The computations use the information. The computations produce an incorrect result if the point is not on the elliptic curve.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A computer implemented method of generating a private key to be used in a cryptographic operation, the cryptographic operation utilizing a particular elliptic curve and being performed in a cryptographic module in a cryptographic system, the method comprising: the cryptographic module generating a private key by: generating a prime number and using the prime number as the private key; or generating a random number and checking the random number for divisibility by small primes, and if the random number is not divisible by small primes, using the random number as the private key; and, the cryptographic module providing the private key to be used in at least one step in the cryptographic operation that utilizes a combination of the private key and a point on the particular elliptic curve.
2. The method according to claim 1 , wherein the point on the particular elliptic curve represents a public key.
3. The method according to claim 1 , wherein the at least one step in the cryptographic operation comprises using information that uniquely identifies the particular elliptic curve.
4. The method according to claim 3 , wherein the information that uniquely identifies the particular elliptic curve comprises a pair of values.
5. The method according to claim 4 , wherein the pair of values correspond to a pair of coefficients a, b for an equation defining the particular elliptic curve.
6. The method according to claim 5 , wherein the at least one step in the cryptographic operation uses the coefficient b in at least one but not all doubling operations performed in combining the private key and the point.
7. The method according to claim 1 , wherein the cryptographic operation comprises recovering a message from a cryptographically encoded message, the message being encoded by the shared secret.
8. The method according to claim 7 , wherein the encoded message utilizes one or more of encryption and authentication.
9. A non-transitory computer readable medium comprising computer executable instructions executed on a computer for generating a shared secret in a cryptographic operation utilizing a particular elliptic curve and being performed in a cryptographic module in a cryptographic system, the computer executable instructions comprising instructions for: the cryptographic module generating a private key by: generating a prime number and using the prime number as the private key; or generating a random number and checking the random number for divisibility by small primes, and if the random number is not divisible by small primes, using the random number as the private key; and the cryptographic module providing the private key to be used in at least one step in the cryptographic operation that utilizes a combination of the private key and a point on the particular elliptic curve.
10. The non-transitory computer readable medium according to claim 9 , wherein the point on the particular elliptic curve represents a public key.
11. The non-transitory computer readable medium according to claim 9 , wherein the at least one step in the cryptographic operation comprises using information that uniquely identifies the particular elliptic curve.
12. The non-transitory computer readable medium according to claim 11 , wherein the information that uniquely identifies the particular elliptic curve comprises a pair of values.
13. The non-transitory computer readable medium according to claim 12 , wherein the pair of values correspond to a pair of coefficients a, b for an equation defining the particular elliptic curve.
14. The non-transitory computer readable medium according to claim 13 , wherein the at least one step in the cryptographic operation uses the coefficient b in at least one but not all doubling operations performed in combining the private key and the point.
15. The non-transitory computer readable medium according to claim 9 , wherein the cryptographic operation comprises recovering a message from a cryptographically encoded message, the message being encoded by the shared secret.
16. The non-transitory computer readable medium according to claim 15 , wherein the encoded message utilizes one or more of encryption and authentication.
17. A cryptographic module on a computer in a cryptographic system comprising computer executable instructions that when executed by the cryptographic module perform the acts of: generating a private key by: generating a prime number and using the prime number as the private key; or generating a random number and checking the random number for divisibility by small primes, and if the random number is not divisible by small primes, using the random, number as the private key; and providing the private key to be used in at least one step in the cryptographic operation that utilizes a combination of the private key and a point on the particular elliptic curve.
18. The cryptographic module according to claim 17 , wherein the point on the particular elliptic curve represents a public key.
19. The cryptographic module according to claim 17 , wherein the at least one step in the cryptographic operation comprises using information that uniquely identifies the particular elliptic curve.
20. The cryptographic module according to claim 19 , wherein the information that uniquely identifies the particular elliptic curve comprises a pair of values.
21. The cryptographic module according to claim 20 , wherein the pair of values correspond to a pair of coefficients a, b for an equation defining the particular elliptic curve.
22. The cryptographic module according to claim 21 , wherein the at least one step in the cryptographic operation uses the coefficient b in at least one but not all doubling operations performed in combining the private key and the point.
23. The cryptographic module according to claim 17 , wherein the cryptographic operation comprises recovering a message from a cryptographically encoded message, the message being encoded by the shared secret.
24. The cryptographic module according to claim 23 , wherein the encoded message utilizes one or more of encryption and authentication.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
July 14, 2010
May 29, 2012
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.