Cryptography – Key management – Key distribution
Reexamination Certificate
2006-01-31
2006-01-31
Moise, Emmanuel L. (Department: 2137)
Cryptography
Key management
Key distribution
C380S030000, C713S161000, C713S171000, C713S174000
Reexamination Certificate
active
06993136
ABSTRACT:
A method of exchanging a cryptographic key between two users that includes the steps of selecting a value p from 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 base point G on the elliptic curve E, where G is of order q; generating a private key w; generating a public key W=wG; distributing p, E, q, G, and Win an authentic manner; agreeing on p, E, q, G, W1, and W2, where W1is the public key of a first user, and where W2is the public key of a second users; each users generating a private integer; each users multiplying G by that user's private integer using a form of p agreed upon; each user transmitting the result of the last step to the other user; each users combining that user's private integer and public key with the other user's result of the tenth step and public key using the form of p agreed upon to form a common secret point between the users; and each user deriving the cryptographic key from the common secret point.
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
J.A. Gordon. Strong primes are easy to find. In T. Beth, N. Coth, and I. Ingermarsson, editors, Advances in Cryptology—EUROCRYPT 84, vol. 209 of Lecture Notes in Computer Science, pp. 216-223. Springer-Verlag, 1985.
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 Cource 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, pp. 519-521. Apr. 1985.
Moise Emmanuel L.
Morelli Robert D.
Teslovich Tamara
The United States of America as represented by the National Secu
LandOfFree
Cryptographic key exchange method using efficient elliptic... 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 key exchange method using efficient elliptic..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic key exchange method using efficient elliptic... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3564523