ASYMMETRIC KEY CRYPTOSYSTEM BASED ON SHARED KNOWLEDGE

• US 20060153364A1
• Filed: 08/08/2005
• Published: 07/13/2006
• Est. Priority Date: 01/07/2005
• Status: Abandoned Application

• Current Assignee: First Data Corporation (Fiserv Incorporated)
• Original Assignee: First Data Corporation (Fiserv Incorporated)
• Inventors: Beeson, Curtis Linn
• Application Number:
  US11/161,555
• Publication Number:
  US 20060153364A1
• Time in Patent Office: Days
• US Class Current: 380/30
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 9/3066 involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
• CPC Class Codes: H04L 9/3252 using DSA or related signature schemes, e.g. elliptic based signatures, ElGamal or Schnorr schemes

Abstract

An asymmetric key cryptosystem is provided using a private key of a public-private key pair by: identifying domain parameters of a finite cyclic group, the domain parameters including an initial generating point; transforming the initial generating point into a new generating point as a deterministic function; generating the public key as a deterministic function of the private key and the domain parameters, in which the new generating point is substituted for the initial generating point; and generating the digital signature as a deterministic function of the private key and the domain parameters, in which the new generating point is substituted for the initial generating point.

Claims

1. In a method including the steps of,

(a) identifying domain parameters that define a finite cyclic group, the domain parameters including a generating point, and

(b) performing a cryptographic operation as a deterministic function that is based upon the domain parameters, an improvement comprising the steps of,

(c) transforming the generating point into another member of the finite cyclic group as a deterministic function of shared knowledge, and

(d) substituting said transformed generating point of said step (c) for said identified generating point of said step (a) in the deterministic function of said step (b).

2. The method of claim 1, wherein said step of transforming the generation point of said step (c) comprises the steps of generating a large integer value from a deterministic function of the shared knowledge and performing scalar multiplication of the generating point by said generated large integer value.

3. The method of claim 1, further comprising the step of clearing from the computer system the new generating point following said step of generating the digital signature so that the generating point is no longer available within the computer system for regenerating the digital signature.

4. The method of claim 1, wherein the deterministic function of said step (b) comprise a deterministic function for generating a public key of a public-private key pair.

5. The method of claim 1, wherein the deterministic function of said step (b) comprise a deterministic function for generating a digital signature.

6. The method of claim 1, wherein the shared knowledge is known to both a first party and a second party different from the first party.

7. The method of claim 6, wherein the shared knowledge comprises an account number for an account of the first party that is maintained with the second party.

8. The method of claim 6, wherein the shared knowledge comprises information that is communicated between the first party and the second party.

9. The method of claim 6, wherein the shared knowledge comprises information that is communicated by a third party both to the first party and the second party.

10. The method of claim 6, wherein the shared knowledge comprises a unique identifier of the first party to the second party.

11. The method of claim 6, wherein the shared knowledge comprises a deterministic function of one or more predefined arguments, wherein the deterministic function and predefined arguments are known both to the first party and the second party, whereby both the first party and the second party may independently calculate the shared knowledge for use in generating the transformer.

12. The method of claim 6, wherein the shared knowledge is input by the first party into a computer system that performs said step (c) of transforming the generating point.

13. Them method of claim 6, wherein said step of identifying the domain parameters of an elliptic curve comprises receiving an identification of the domain parameters from the second party.

14. The method of claim 6, wherein said step of identifying the domain parameters of an elliptic curve comprises selecting the domain parameters by the first party, and wherein the method further comprises the step of communicating by the first party said selected domain parameters to the second party.

15. The method of claim 1, wherein said deterministic function of said step (b) includes as an argument thereof a private key utilized in public-private key cryptography.

16. The method of claim 2, wherein the private key is generated as a deterministic function of user input data.

17. The method of claim 16, wherein the user input data represents a passphrase, password, or PIN.

18. The method of claim 16, wherein the user input data represents a biometric characteristic.

19. The method of claim 16, further comprising the step of clearing the user input data from the computer system following said step of generating the private key so that the user input data must be received again within the computer system in order to regenerate the private key within the computer system.

20. The method of claim 16, further comprising the step of clearing the private key from the computer system following said step of generating the digital signature so that the private key must be regenerated within the computer system in order to generate a digital signature within the computer system using the deterministic function of said step (c).

21. The method of claim 15, wherein the private key is generated as a nondeterministic function of a random number generator.

22. A method including the steps of,

(a) transforming an initial generating point of domain parameters that define a finite cyclic group into another member of the finite cyclic group as a deterministic function of shared knowledge, and

(b) performing a cryptographic operation as a deterministic function that is based upon the domain parameters, wherein said transformed generating point of said step (a) is substituted for the initial generating point of the domain parameters.

23. A computer-readable medium having computer-executable instructions for performing the steps comprising:

(a) transforming an initial generating point of domain parameters that define a finite cyclic group into another member of the finite cyclic group as a deterministic function of shared knowledge, and

(b) performing a cryptographic operation as a deterministic function that is based upon the domain parameters, wherein said transformed generating point of said step (a) is substituted for the initial generating point of the domain parameters.