Public key authentication and key agreement for low-cost termina

Details Public key authentication and key agreement for low-cost termina Public key authentication and key agreement for low-cost termina

1993-08-02

1995-04-11

Gregory, Bernarr E.

Cryptography

Particular algorithmic function encoding

Public key

380 9, 380 21, 380 23, 380 49, H04L 930, H04L 908, H04L 932

Patent

active

054066280

ABSTRACT:
A method for achieving mutual authentication and session key agreement between a first party 12 which has minimal computational resources and a second party 18 which has substantial computational resources utilizes a modular square root operation for certificate authentication and key distribution and an ElGamal, NIST DSS, or other efficient signature operation for obtaining the signature of a message. Theses operations are highly advantageous in a system with asymmetric resources because the computation power required to perform these operations is far less than the computation power required to invert these operations. The entire mutual authentication and session key agreement method can be carried out using only between one and three modular multiplications on the weak computational side.

REFERENCES:
patent: 4759063 (1988-07-01), Chaum
patent: 4885777 (1989-12-01), Takaragi et al.
patent: 5016274 (1991-05-01), Micali et al.
patent: 5218637 (1993-06-01), Angebaud et al.
National Bureau of Standards, Data Enryption Standard, FIPS-PUB-46, 1977.
A. Shimizu et al., FEAL-Fast Data Encipherment Algorithm, Systems and Computers in Japan, vol. 19, No. 7, pp. 20-34, 1988.
S. Miyaguchi, The FEAL Cipher Family, Proceedings of CRYPTO '90, Santa Barbara, Calif., Aug. 1990.
R. C. Rivest et al., A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, vol. 21, No. 2, pp. 120-126, Feb. 1978.
T. Elgamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. on Info. Theory, vol. IT-31, No. 4, pp. 469-472, Jul. 1985.
M. O. Rabin, Digitalized Signatures and Public Key Functions as Intractable as Factorization, MIT Laboratory for Computer Science, TR 212, Jan. 1979.
S. Goldwasser et al., A Digital Signature Scheme Secured Against Adaptive Chosen-Message Attacks, SIAM J. COMPUT., vol. 17, No. 2, pp. 281-308, Apr. 1988.
N. Koblitz, A Course in Number Theory and Cryptography, Springer Verlag, p. 32, 1987.
S. Even et al., On-Line/Off-Line Digital Signatures, in Advances in Cryptology-CRYPTO 89.
Proceedings, G. Brassard (ed.), Lecture Notes in Computer Science, vol. 435, Springer-Verlag, pp. 263-275, 1990.
C. P. Schnorr, Efficient Signature Generation by Smart Cards, Journal of Cryptology, vol. 4, No. 3, pp. 161-174, Mar. 1991.
A. Shamir, An Efficient Identification Scheme Based on Permuted Kernels, Proceedings of CRYPTO '89, G. Brassard, Ed., LNCS 435, pp. 606-609, Apr. 1989.
A. Fiat et al., How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings of CRYPTO '86, A. M. Odlyzko, Ed., LNCS 263, pp. 186-194, 1987.

Affiliated with

Also associated with

Rating

Public key authentication and key agreement for low-cost termina does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Public key authentication and key agreement for low-cost termina, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Public key authentication and key agreement for low-cost termina will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1544315