A method for obtaining digital signatures and public-key cryptosystems

Метод получения цифровых подписей и криптосистем с открытым ключом
Ronald L. Rivest, Adi Shamir, Leonard M. Adleman
1978-02-01

RSA encryptiondigital signaturesinteger factorizationmodular exponentiationpublic-key cryptosystems
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 .
1
Defines encryption and decryption through modular exponentiation using publicly known n and e, with secret d satisfying e·d ≡ 1 mod (p−1)(q−1).
2
Enables secure communication without courier-delivered keys: anyone can encrypt using a recipient’s public key, while only the recipient can decrypt.
3
Introduces a public-key encryption method where revealing the encryption key does not reveal the corresponding decryption key.
4
Supports digital signatures created with a private decryption key and publicly verified using the corresponding encryption key.
5
The system’s security partly relies on the computational difficulty of factoring the public modulus n into its secret prime factors p and q.

Public-key cryptosystem based on modular exponentiation with modulus n = p·q

the separation of publicly disclosed encryption keys from secret decryption keys, enabling secure encryption, signature verification, and unforgeability based on the difficulty of factoring the modulus

Publication Details
Publication Date
1978-02-01
Journal
Publisher
ISSN
Access Type
Author Information
Authors
Ronald L. Rivest
Adi Shamir
Leonard M. Adleman
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat
Make a presentation
100%