Cryptography – Particular algorithmic function encoding – Public key
Patent
1996-05-21
1998-04-07
Cain, David C.
Cryptography
Particular algorithmic function encoding
Public key
380 2, H04K 100
Patent
active
057374252
ABSTRACT:
A cryptosystem and cryptographic method are provided for performing tasks such as encoding/decoding, signing messages, and verifying identity. The system and method employ a problem which is difficult to solve in the worst case. Because of the worst-case nature of the problem employed, a system and method according to the invention has advantageous level of security, In a class of preferred embodiments, the difficult problem is one of the recognized difficult problems associated with the mathematical theory of lattices. These problems include finding short vectors and sets of basis vectors from a lattice. Cryptographic protocols are performed, using these problems.
REFERENCES:
patent: 4200770 (1980-04-01), Hellman et al.
patent: 4218582 (1980-08-01), Hellman et al.
patent: 4405829 (1983-09-01), Rivest et al.
patent: 4424414 (1984-01-01), Hellman et al.
patent: 4932056 (1990-06-01), Shamir
patent: 4995082 (1991-02-01), Schnorr
patent: 5231668 (1993-07-01), Kravitz
patent: 5297206 (1994-03-01), Orton
A. V. Aho et al., "The Design and Analysis of Computer Algorithms ", Addison-Wesley publishing Co., Chapter 10, pp. 364-365.
M. R. Garey et al., "Computers and Intractability: A Guide to the Theory of NP-Completeness ", W. H. Freeman and Co., Chapter 1, pp. 1-14.
D. S. Johnson, "Algorithms and Complexity ", Handbook of Theoretical Computer Science, Vol. A, Chapter 2, The MIT Press, 1990, pp. 69-77.
R. L. Rivest, "Algorithms and Compexity ", Handbook of Theoretical Computer Science, vol. A, Chapter 13, The MIT Press, 1990, pp. 99.719-729.
M. Grotschel, L. Lovasz, A. Schrijver, Geometric Alogrithms and Combinatorial Optimization, 2nd Corrected Edition-Book; QAA167, G761, 1993 Math; Chapter 5, Diophantine Approximation and Basis Reduction, pp. 133-156.
Ajtai, "Generating Hard Instances of Lattice Problems ", Electronic Colloquium on Computational Complexity, Report TR96-007, posted on the World Wide Web at ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1996/TR96-007/index.html Jan. 30, 1996.
Cain David C.
International Business Machines - Corporation
Pintner James C.
LandOfFree
Cryptosystem employing worst-case difficult-to solve lattice pro does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Cryptosystem employing worst-case difficult-to solve lattice pro, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptosystem employing worst-case difficult-to solve lattice pro will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-21088