Method for exponentiating in cryptographic systems

Cryptography – Particular algorithmic function encoding

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

380 30, 380 50, H04K 100

Patent

active

052992624

ABSTRACT:
An improved cryptographic method utilizing exponentiation is provided which has the advantage of reducing the number of multiplications required to determine the legitimacy of a message or user. The basic method comprises the steps of selecting a key from a preapproved group of integer keys g; exponentiating the key by an integer value e, where e represents a digital signature, to generate a value g.sup.e ; transmitting the value g.sup.e to a remote facility by a communications network; receiving the value g.sup.e at the remote facility; and verifying the digital signature as originating from the legitimate user. The exponentiating step comprises the steps of initializing a plurality of memory locations with a plurality of values g.sup.xi ; computi

REFERENCES:
patent: 4200770 (1980-04-01), Hellman et al.
patent: 4424414 (1984-01-01), Hellman et al.
patent: 4748668 (1988-05-01), Shamir et al.
patent: 4933970 (1990-06-01), Shamir
patent: 4964164 (1990-10-01), Fiat
patent: 4995082 (1991-02-01), Schnorr
patent: 5121429 (1992-06-01), Guppy et al.
patent: 5166978 (1992-11-01), Quisquater
W. Diffie et al., "New Directions in Cryptography", IEEE Transactions on Information Theory, vol. 22, No. 6, Nov. 1976, pp. 644-654.
T. ElGamal, "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms", IEEE Transactions on Information Theory, vol. 31, No. 4, Jul. 1985, pp. 469-472.
A. Fiat et al., "How to Prove Yourself: Practical Solutions to Identification and Signature Problems", Advances in Cryptology (Proceedings of Crypto '86), vol. 263, 1987, pp. 186-194.
C. P. Schnorr, "Efficient Identification and Signatures for Smart Cards", Advances in Cryptology (Proceedings of Crypto '89), vol. 435, 1990, pp. 239-251.
C. P. Schnorr, "Efficient Signature Generation for Smart Cards", Journal of Cryptology, vol. 4, No. 3, 1991, pp. 161-174.
E. Brickell et al., "An Interactive Identification Scheme Based on Discrete Logarithms and Factoring", Advances in Cryptology (Proceedings of Eurocrypt '90), vol. 473, May 1990, pp. 63-71.
D. E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, Second Edition, 1981, pp. 194, 441-447, and 564.
G. B. Agnew et al., "Fast Exponentiation in GF(2.sup.n)", Advances in Cryptology (Proceedings of Eurocrypt '88), vol. 330, May 1988, pp. 251-255.
T. Beth et al., "Architectures for Exponentiation in GF(2.sup.n)", Advances in Cryptology (Proceedings of Crypto '86), vol. 263, 1986, pp. 302-310.
T. Beth, "Efficient Zero-Knowledge Identification Scheme for Smart Cards", Advances in Cryptology (Proceedings of Eurocrypt '88) vol. 330, May 1988, pp. 77-84.
D. R. Stinson, "Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2.sup.n)", SIAM J. Comput., vol. 19, No. 4, Aug. 1990, pp. 711-717.
J. Bos et al., "Addition Chain Heuristics", Advances in Cryptology (Proceedings of Crypto 1989), vol. 435, 1990, pp. 400-407.
D. Matula, "Basic Digit Sets for Radix Representation", Journal of the ACM, vol. 29, No. 4, Oct. 1982, pp. 1131-1143.
R. Rivest et al., "A Method for Obtaining Digital Signatures and Public Key Cryptosystems", Communications of the ACM, vol. 21, No. 2, Feb. 1978, pp. 120-126.
A. Yao, "On the Evaluation of Powers", SIAM J. Comput., vol. 5, No. 1, Mar. 1976, pp. 100-103.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for exponentiating in cryptographic systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for exponentiating in cryptographic systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for exponentiating in cryptographic systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-798734

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.