Cryptography – Key management – Having particular key generator
Patent
1995-03-09
1996-11-19
Cain, David C.
Cryptography
Key management
Having particular key generator
380 25, 380 30, 36422421, H04L 900
Patent
active
055771246
ABSTRACT:
A method is disclosed whereby a high performance, high integrity, cryptographically secure sequence generator based on zeta one-way functions is specified for pseudorandom sequence generation, authentication, key transfer by public discussion, and message transmission by public-key encryption. The method encompasses a new one-way function with trapdoor based on Artin reciprocity in an algebraic number field. Public keys are pseudorandom sequences based on zeta one-way functions. In the simplest instance of this method, public keys are quadratic signatures, i.e. special sequences of Jacobi symbols. The generation, transfer, and sharing of private keys is a process based on the law of quadratic reciprocity. The computational complexity of the quadratic signature problem provides the foundation for the cryptographic security of this method. This new trapdoor one-way function is distinct from constructions in the prior art.
REFERENCES:
patent: 4200770 (1980-04-01), Hellman et al.
patent: 4405829 (1983-09-01), Rivest et al.
patent: 5159632 (1992-10-01), Crandall
patent: 5272755 (1993-12-01), Miyaji et al.
patent: 5373558 (1994-12-01), Chaum
"Zeta Functions, One-Way Functions, and Cryptography," M. Anshel and D. Goldfeld. A.M.S. Abstracts, vol. 15, No. 3, Apr. 1994, p. 349, #892-11-157.
"Open Problems in Number Theoretic Complexity, II," L. Adleman and K. McCurley. Algorithmic Number Theory, 1st Intl. Symposium, ANTS-I, May 6-9, 1994.
The Codebreakers: The Story of Secret Writing, pp. 394-396. David Kahn.
Communication Theory of Secrecy Systems, journal pp. 657-715. C. E. Shannon. Entire Manuscript provided.
"An Extension of the Shannon Theory Approach to Cryptography," C. E. Shannon. IEEE Transactions on Information Theory, vol. IT-23, No. 3 May 1977, pp. 289-294.
"Cryptography," Ronald L. Rivest. Handbook of Theoretical Computer Science, Volume A: Algorithms & Complexity, 1994. pp. 721-738.
"How To Generate Cyrptographically Strong Sequences of Pseudo-Random Bits," M. Blum and S. Micali, SIAM Journal on Computing, vol. 13, No. 4 (1984).
"One Way Functions and Pseudorandom Generators," L. A. Levin. Combinatorica 7, 1987, pp. 357-363.
"New Directions in Cryptography," W. Diffie and M. Hellman. IEEE Transactions on Information Theory, vol. IT-22, No. 6, Nov. 1976, pp. 644-654.
"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems." R. L. Rivest, A. Shamir and L. Adleman, Communications of the ACM 21, 1978, pp. 120-126.
"Odds and Ends from Cryptology and Computational Number Theory," K. McCurley. Cryptology and Computational Number Theory, 1990, p. 162.
"Probabilistic Encryption," S. Goldwasser and S. Micali. Journal of Computer and System Sciences 26(2), 1984, pp. 270-299.
"On the Randomness of Legendre and Jacobi Sequences," I. V. Damgard. Advances in Cryptology (Proceedings of Crypto '88), Lecture Notes in Computer Science, 1990, pp. 163-172.
Anshel Michael M.
Goldfeld Dorian
Arithmetica, Inc.
Cain David C.
LandOfFree
Multi-purpose high speed cryptographically secure sequence gener does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multi-purpose high speed cryptographically secure sequence gener, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-purpose high speed cryptographically secure sequence gener will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-547240