Online citations, reference lists, and bibliographies.
← Back to Search

A Method For Obtaining Digital Signatures And Public-key Cryptosystems

R. Rivest, A. Shamir, L. Adleman
Published 1983 · Computer Science

Cite This
Download PDF
Analyze on Scholarcy
Share
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: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 intended recipient. Only he can decipher the message, since only he knows the corresponding decryption key. 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 prime 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.
This paper references



This paper is referenced by
10.1016/j.procs.2017.05.266
Identification of Quasi-Stationary Dynamic Objects with the Use of Derivative Disproportion Functions
V. Kalashnikov (2017)
10.15680/IJIRSET.2014.0312008
Analysis of Network Data Encryption &Decryption Techniques in CommunicationSystems
C. J. Ezeofor (2014)
10.1007/978-3-030-30577-2_86
Scalable Security Based on Data Classification Using Generalized RSA in Cloud Storage
A. Khalique (2020)
Foundations of Cryptography – a Primer Foundations of Cryptography – a Primer Boston – Delft Foundations and Trends
A. Primer (2005)
10.1007/S00500-018-3332-5
An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
C. Meshram (2019)
10.1016/j.inffus.2020.04.009
A survey on secure communication techniques for 5G wireless heterogeneous networks
A. Kakkar (2020)
10.1016/J.FUTURE.2019.04.022
DStore: A distributed system for outsourced data storage and retrieval
Jingting Xue (2019)
10.1007/978-3-030-05366-6_27
Efficient Searching Over Encrypted Database: Methodology and Algorithms
Varad Deshpande (2019)
10.1109/MYSEC.2014.6986028
Insight into the operation of NTRU and a comparative study of NTRU, RSA and ECC public key cryptosystems
J. N. Gaithuru (2014)
10.1109/ACSSC.2015.7421164
CRT RSA decryption: Modular exponentiation based solely on Montgomery Multiplication
João Carlos Néto (2015)
10.1007/978-3-319-33630-5_20
RegRSA: Using Registers as Buffers to Resist Memory Disclosure Attacks
Y. Zhao (2016)
10.11113/JT.V78.6922
INTEGRATION OF CFEA-COMPRESSION TECHNIQUE INTO ASYMMETRIC KEY CRYPTOSYSTEMS
A. Mandangan (2015)
10.1038/srep06774
Unconditionally secure commitment in position-based quantum cryptography
M. Nadeem (2014)
10.1007/978-3-319-19713-5_11
On the (Non)Improvement of an Authenticated GKT Protocol
Ruxandra F. Olimid (2015)
10.1016/j.ffa.2017.11.009
A class of new permutation trinomials
Ziran Tu (2018)
10.1007/978-981-10-5065-7_11
Mathematical Approach for Recovering Secret Key from Its Noisy Version
Noboru Kunihiro (2017)
10.1007/978-981-4585-33-0_25
A New Threshold-Authenticated Encryption Scheme
Mohd Saiful Adli Mohamad (2014)
10.1007/978-3-319-27179-8_8
A Novel Key Management for Virtually Limitless Key Size
Damir Omerasevic (2015)
10.1090/S0025-5718-1981-0595059-1
Asymptotically fast factorization of integers
J. Dixon (1981)
10.1007/BFb0017304
Recent Directions in Algorithmic Research
J. Hopcroft (1981)
10.1109/TCOM.1981.1095068
Security Requirements and Protocols for a Broadcast Scenario
S. Kent (1981)
10.1007/978-1-4757-0602-4_15
On the Security of Multi-Party Protocols in Distributed Systems
D. Dolev (1982)
10.1201/b15718-14
Primality and factorization
H. Lenstra (1983)
10.1145/356909.356913
Security Mechanisms in High-Level Network Protocols
V. Voydock (1983)
10.1016/0020-0190(83)90083-2
Trapdoor Knapsacks Without Superincreasing Structure
M. Willett (1983)
10.1007/3-540-39568-7_23
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
M. Blum (1984)
10.1007/3-540-39799-X_14
Public Protection of Software
A. Herzberg (1985)
10.1049/EL:19860395
Fast public-key cryptosystem using congruent polynomial equations
Tatsuaki Okamoto (1986)
10.1007/BFb0026969
Replicated Distributed Processing
S. Shrivastava (1986)
10.1007/3-540-47721-7_4
Some Variations on RSA Signatures and Their Security
W. D. Jonge (1986)
10.1007/978-94-009-2794-0_7
What Happened with Knapsack Cryptographic Schemes
Y. Desmedt (1988)
10.1137/0217023
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
Carl Pomerance (1988)
See more
Semantic Scholar Logo Some data provided by SemanticScholar