Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2005-05-24
2005-05-24
Caldwell, Andrew (Department: 2137)
Cryptography
Particular algorithmic function encoding
C380S030000, C713S161000, C713S171000, C713S174000
Reexamination Certificate
active
06898284
ABSTRACT:
A method of identifying user, generating digital signature, and verifying digital signature by selecting a modulus p in the form of p=(2dk−2ck−1)/r, p=(2dk−2(d−1)k+2(d−2)k− . . . −2k+1)/r, p=(2dk−2ck−1)/r, p=(2dk−2ck+1)/r, and p=(24k−23k+22k+1)/r, selecting an elliptic curve E and an order q; selecting a basepoint G; generating a private key w; generating a public key W=wG; distributing p, E, q, G, and W to at least a prover, a verifier, and a signer; generating the prover's private key wpand public key Wp=wpG; retrieving the prover's public key Wp; generating a private integer kp; combining kpand G to form K using p; sending K to the verifier; sending a challenge integer c to the prover; combining c, kp, and wpto form a response integer v; sending v to the verifier; combining cG, K, and Wpusing p and checking to see if the combination is equal to vG. If not so, stop. Otherwise, generating, by the signer, the signer's private key ws; generating a private integer ks; combining ksand G to form K using p; combining K and a message M to form an integer h; combining h, ks, and wsto form an integer s; sending M and (K,s) as a digital signature of M; retrieving Wp; receiving M and (K,s); combining K and M to form an integer h; and combining h, K, and Wpusing p and checking to see if the combination is equal to sG. If so, the digital signature is verified.
REFERENCES:
patent: 4200770 (1980-04-01), Hellman et al.
patent: 5159632 (1992-10-01), Crandall
patent: 5271061 (1993-12-01), Crandall
patent: 5463690 (1995-10-01), Crandall
patent: 5581616 (1996-12-01), Crandall
patent: 5805703 (1998-09-01), Crandall
patent: 6049610 (2000-04-01), Crandall
D. Johnson and A. Menezes, “The Elliptic Curve Digital Signature Algorithm (ECDSA),” University of Waterloo, Aug. 23, 1999, http://cacr.math.waterloo.ca.*
J. Solinas. “Generalized mersenne numbers”. Technical Report CORR-39, University of Waterloo, Sep. 1999, also available at http://cacr.math.waterloo.ca.*
FIPS PUB 186-2, Jan. 27, 2000, Digital Signature Standard, U.S. Dept. of Commerce (NIST).
Victor S. Miller, “Use of Elliptic Curves in Cryptography”, Advances in Cryptography-Crypto 85, LNCS 218, pp. 417-426, 1986.
Neil Kobutz, “A Course in Number Theory and Cryptography,” QA 241.K672, 1987, pp. 150-179.
Peter L. Montgomery, “Modular Multiplication Without Trail Division,” Mathematics of Computation, vol. 44, No. 170, Apr. 1985 pp. 519-521.
Caldwell Andrew
Morelli Robert D.
Teslovich Tamara
The United States of America as represented by the National Secu
LandOfFree
Cryptographic identification and digital signature method... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Cryptographic identification and digital signature method..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic identification and digital signature method... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3451121