Method for exponentiating in cryptographic systems
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 The United States Government has rights in this invention pursuant to Contract No. DE-AC04-76DP00789 between the Department of Energy and AT&T Company.
- Inventors:
-
- Albuquerque, NM
- San Diego, CA
- Issue Date:
- Research Org.:
- AT&T
- OSTI Identifier:
- 869219
- Patent Number(s):
- 5299262
- Assignee:
- United States of America as represented by United States (Washington, DC)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
H - ELECTRICITY H04 - ELECTRIC COMMUNICATION TECHNIQUE H04L - TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- DOE Contract Number:
- AC04-76DP00789
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- method; exponentiating; cryptographic; systems; improved; utilizing; exponentiation; provided; advantage; reducing; multiplications; required; determine; legitimacy; message; user; basic; comprises; steps; selecting; key; preapproved; integer; keys; value; represents; digital; signature; generate; transmitting; remote; facility; communications; network; receiving; verifying; originating; legitimate; step; initializing; plurality; memory; locations; values; xi; computi; united; government; rights; pursuant; contract; de-ac04-76dp00789; department; energy; company; method comprises; method utilizing; method comprise; communications network; memory location; /380/713/
Citation Formats
Brickell, Ernest F, Gordon, Daniel M, and McCurley, Kevin S. Method for exponentiating in cryptographic systems. United States: N. p., 1994.
Web.
Brickell, Ernest F, Gordon, Daniel M, & McCurley, Kevin S. Method for exponentiating in cryptographic systems. United States.
Brickell, Ernest F, Gordon, Daniel M, and McCurley, Kevin S. Sat .
"Method for exponentiating in cryptographic systems". United States. https://www.osti.gov/servlets/purl/869219.
@article{osti_869219,
title = {Method for exponentiating in cryptographic systems},
author = {Brickell, Ernest F and Gordon, Daniel M and McCurley, Kevin S},
abstractNote = {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 The United States Government has rights in this invention pursuant to Contract No. DE-AC04-76DP00789 between the Department of Energy and AT&T Company.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Sat Jan 01 00:00:00 EST 1994},
month = {Sat Jan 01 00:00:00 EST 1994}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
New directions in cryptography
journal, November 1976
- Diffie, W.; Hellman, M.
- IEEE Transactions on Information Theory, Vol. 22, Issue 6
A method for obtaining digital signatures and public-key cryptosystems
journal, February 1978
- Rivest, R. L.; Shamir, A.; Adleman, L.
- Communications of the ACM, Vol. 21, Issue 2
Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
journal, August 1990
- Stinson, D. R.
- SIAM Journal on Computing, Vol. 19, Issue 4
Basic digit sets for radix representation
journal, October 1982
- Matula, David W.
- Journal of the ACM, Vol. 29, Issue 4
Fast Exponentiation in GF(2n)
book, January 1988
- Agnew, G. B.; Mullin, R. C.; Vanstone, S. A.
- Lecture Notes in Computer Science
Efficient signature generation by smart cards
journal, January 1991
- Schnorr, C. P.
- Journal of Cryptology, Vol. 4, Issue 3
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
book, January 1991
- Brickell, Ernest F.; McCurley, Kevin S.
- Advances in Cryptology — EUROCRYPT ’90
Efficient Zero-Knowledge Identification Scheme for Smart Cards
book, January 1988
- Beth, Thomas
- Lecture Notes in Computer Science
Addition Chain Heuristics
book,
- Bos, Jurjen; Coster, Matthijs
- Advances in Cryptology — CRYPTO’ 89 Proceedings
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
book, January 2007
- Fiat, Amos; Shamir, Adi
- Advances in Cryptology — CRYPTO’ 86
Architectures for exponentiation in GF(2n)
book, January 2000
- Beth, T.; Cook, B. M.; Gollmann, D.
- Advances in Cryptology — CRYPTO’ 86
On the Evaluation of Powers
journal, March 1976
- Yao, Andrew Chi-Chih
- SIAM Journal on Computing, Vol. 5, Issue 1
A public key cryptosystem and a signature scheme based on discrete logarithms
journal, July 1985
- Elgamal, T.
- IEEE Transactions on Information Theory, Vol. 31, Issue 4
Efficient Identification and Signatures for Smart Cards
book, January 2001
- Schnorr, C. P.
- Advances in Cryptology — CRYPTO’ 89 Proceedings