A method for obtaining digital signatures and public-key cryptosystems
Open Access
- 1 February 1978
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (2), 120-126
- https://doi.org/10.1145/359340.359342
Abstract
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intented recipient. Only he can decipher the message, since only he knows the corresponding decryption key. (2) A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n , of two large secret primer numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d ≡ 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n .Keywords
This publication has 9 references indexed in Scilit:
- Secure communications over insecure channelsCommunications of the ACM, 1978
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption StandardComputer, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- SOME CRYPTOGRAPHIC APPLICATIONS OF PERMUTATION POLYNOMIALSCryptologia, 1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- RegisterPublished by Walter de Gruyter GmbH ,1975
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974