Cryptography – Particular algorithmic function encoding – Public key
Patent
1996-04-12
1998-07-28
Tarcza, Thomas H.
Cryptography
Particular algorithmic function encoding
Public key
380 28, 380 25, 380 23, H04K 100, H04L 900
Patent
active
057871787
ABSTRACT:
A computerized method for signing a message, where a secret key is used for signing and the signature can be tested with the help of a public key, provides for the public key to be a number n that is the product of two large prime numbers p and q; the secret key includes at least one of the two prime numbers; a polynomial is created in the form P(x)=x.sup.k +a.sub.k-1 x.sup.k-1 + . . . +a.sub.1 x+a.sub.0, whose coefficients a.sub.k-1 . . . a.sub.0 are formed from the message, taking into account a random number. This polynomial is used to derive additional polynomials P(x) mod p and P(x) mod q whose zeros in the respective finite fields GF(p) and GF(q) are defined. The zeros are combined into one or more solutions z of the equation P(x) mod n=0, and the random number and the solution z or selected solutions z are added as the signature to the message.
REFERENCES:
patent: 4625076 (1986-11-01), Okamoto et al.
patent: 5220606 (1993-06-01), Greenberg
patent: 5231668 (1993-07-01), Kravitz
patent: 5263085 (1993-11-01), Shamir
patent: 5373561 (1994-12-01), Haber et al.
patent: 5442707 (1995-08-01), Miyaji et al.
Offical Gazette, vol. 1184, Mar. 26,1996, p. 100.
Rivest, R. et al., "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, vol. 21, No. 2 (Feb. 1978), pp. 120-126.
Diffie, W. et al., "New Directions in Cryptography", IEEE Transactions on Information Theory, vol. IT-22, No. 6, Nov. 1976, pp. 644-654.
Ben-Or, "Probabilistic Algorithms in Finite Fields", CH-1695-6/81/0000/0394$00.75 1981 IEEE, pp. 394-398.
Brecht, B., "The Future Has Already Started or Public Key Cryptography", pp. 97-106.
Michael Ben-Or, "Probabilistic Algorithms in Finite Fields", 22nd Annual Symposium on Foundations of Computer Science, pp. 394-398, Oct. 28-30, 1981.
Michale O. Rabin, "Digitalized Signatures and Public-Key Functions as Intractable as Factorization", MIT/LCS/TR-212, Jan. 1979.
Deutsche Telekom AG
Tarcza Thomas H.
White Carmen D.
LandOfFree
Computerized method for signing a message does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computerized method for signing a message, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computerized method for signing a message will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-29444