Multiple cryptographic key precompute and store

Details Multiple cryptographic key precompute and store Multiple cryptographic key precompute and store

2006-03-21

2006-03-21

Morse, Gregory (Department: 2134)

Cryptography

Key management

Having particular key generator

C380S047000

Reexamination Certificate

active

07016494

ABSTRACT:
A method and apparatus provides cryptographic parameters for use in cryptographic applications in response to requests therefor. The method includes the steps of: pre-computing one or more different types of sets of cryptographic parameters, each the type of set being adapted for use by an associated type of cryptographic application; securely storing the pre-computed sets of cryptographic parameters in a memory storage unit; receiving a request for a set of cryptographic parameters having specified characteristics for use in a particular cryptographic application; determining one of the sets of cryptographic parameters stored in the memory storage unit that has specified characteristics; accessing the determined set of cryptographic parameters from the memory storage unit; and providing the determined set of cryptographic parameters with minimal latency.

REFERENCES:
patent: 4168396 (1979-09-01), Best
patent: 4200770 (1980-04-01), Hellman et al.
patent: 4218582 (1980-08-01), Hellman et al.
patent: 4278837 (1981-07-01), Best
patent: 4319079 (1982-03-01), Best
patent: 4351982 (1982-09-01), Miller et al.
patent: 4405829 (1983-09-01), Rivest et al.
patent: 4424414 (1984-01-01), Hellman et al.
patent: 4433207 (1984-02-01), Best
patent: 4465901 (1984-08-01), Best
patent: 4514592 (1985-04-01), Miyaguchi
patent: 4995082 (1991-02-01), Schnorr
patent: 5046094 (1991-09-01), Kawamura et al.
patent: 5321752 (1994-06-01), Iwamura et al.
patent: 5325433 (1994-06-01), Torii et al.
patent: 5343527 (1994-08-01), Moore
patent: 5351298 (1994-09-01), Smith
patent: 5421006 (1995-05-01), Jablon et al.
patent: 5457748 (1995-10-01), Bergum et al.
patent: 5761310 (1998-06-01), Naciri
patent: 5835594 (1998-11-01), Albrecht et al.
patent: 5844986 (1998-12-01), Davis
patent: 5848159 (1998-12-01), Collins et al.
patent: 5930362 (1999-07-01), Daly et al.
patent: 6091819 (2000-07-01), Venkatesan et al.
patent: 6125185 (2000-09-01), Boesch
patent: 6307936 (2001-10-01), Ober et al.
patent: 6578057 (2003-06-01), Hori
S.A. Vanstone et al., “Using Four-Prime RSA in Which Some of the Bits are Specified,” Dec. 8, 1994, Electronics Letter, vol. 30, No. 25. pp. 2118-2119.
C. Couvruer et al., “An Introduction to Fast Generation of Large Prime Numbers,” 1982, Philips Journal of Research, vol. 37, Nos. 5-6, pp. 231-264.
Y. Desmedt et al., “Public-Key Systems Based on the Difficulty of Tampering (Is There a Difference Between DES and RSA?),” 1986, Lecture Notes in Computer Science, Advances in Cryptology-CRYPTO '86 Proceedings.
J. J. Quisquater et al., “Fast Decipherment Algorithm for RSA Public-Key Cryptosystem,” Oct. 1982, Electronics Letters, vol. 19, No. 21.
CETIN KAYA KOC, “High-Speed RSA Implementation (Version 2.0),” Nov. 1994, RSA White Paper, RSA Laboratories.
Rivest et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Feb. 1978, Communications of the ACM, vol. 21.
PKCS #1: RSA Encryption Standard (Version 1.5), Nov. 1993, RSA Laboratories Technical Note.
M.O. Rabin, “Digitalized Signatures and Public-Key Functions as Intractable as Factorization,” Jan., 1979, MIT Laboratory for Computer Science.
R. Lidl et al., “Permutation Polynomials in RSA-Cryptosystems,” 1984, Advances in Cryptology-Crypto '83, pp. 293-301.
D. Boneh et al., “Generating a Product of Three Primes with an Unknown Factorization,” Computer Science Department, Stanford University.
J. J. Quisquater et al., “Fast Generation of Large Prime Numbers” Jun. 1982, Library of Congress, Catalog No. 72-179437, IEEE Catalog No. 82CHI767-3 IT, pp. 114-115.
A. J. Menezes et al., “Handbook of Applied Cryptography”, 1997, Library of Congress catalog No. 96-27609, pp. 89, 612-613.
P.J. Flinn et al., “Using the RSA Algoithm for Encryption and Digital Signatures: Can You Encrypt, Decrypt, Sign and Verify Without Infringing the RSA Patent?”, Jul. 9, 1997, 17 pgs. http://www.cyberlaw.com/rsa.html.
NEMO, “RSA Moduli Should Have 3 Prime Factors”, 1996.

Affiliated with

Also associated with

Rating

Multiple cryptographic key precompute and store does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multiple cryptographic key precompute and store, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple cryptographic key precompute and store will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3571774