# A method for obtaining digital signatures and public-key cryptosystems

@article{Rivest1978AMF, title={A method for obtaining digital signatures and public-key cryptosystems}, author={Ronald L. Rivest and Adi Shamir and Leonard M. Adleman}, journal={Commun. ACM}, year={1978}, volume={21}, pages={120-126} }

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… Expand

#### Supplemental Presentations

Presentation Slides

A method for obtaining digital signatures and public-key cryptosystems

#### Tables and Topics from this paper

#### Paper Mentions

#### 8,342 Citations

A Modified RSA Encryption Technique Basedon Multiple public keys

- Computer Science
- 2013

This paper has done an efficient implementation of RSA algorithm using two public key pairs and using some mathematical logic rather than sending the e value directly as a public key, because if an attacker has opportunity of getting the d value they can directly find d value and decrypt the message. Expand

Probabilistic cryptosystem with two pairs of private/public keys

- Computer Science
- 2017 International Conference on Electrical and Computing Technologies and Applications (ICECTA)
- 2017

The proposed algorithm mitigates the effect of situation where one of the private keys is disclosed, and the attacker should get the two private keys rather than one to completely attack the system. Expand

An Efficient Key Distribution Protocol Based on BB84

- Mathematics
- 2014

Private key cryptography suffers from a major weakness - it requires sharing of a secret key between two parties. An intruder can copy the secret key as it is being exchanged, thereby severely… Expand

Modified RSA Encryption Algorithm (MREA)

- Computer Science
- 2012 Second International Conference on Advanced Computing & Communication Technologies
- 2012

This scheme presents a new cryptography algorithm based on additive homomorphic properties called Modified RSA Encryption Algorithm (MREA), which is secure as compared to RSA as it is based on the factoring problem as well as decisional composite residuosity assumptions which is the intractability hypothesis. Expand

Secure Data Communication using Cryptography and Steganography Standards

- Computer Science
- 2015

This paper has done an efficient implementation of RSA algorithm using two public key pairs and using some mathematical logic rather than sending the value directly as a public key. Expand

A Hybrid Digital Signature Technique using Cryptosystem

- Computer Science
- 2021

This article presents a precise writing review of different computerized signature frameworks dependent on RSA, and a basic report is completed on the key age, the creation of marks, the mark check of differentComputerized signature approaches. Expand

Advances in signatures, encryption, and E-Cash from bilinear groups

- Computer Science
- 2006

This work presents the first public key signature scheme where a semi-trusted proxy, given special information, can translate Alice's signature on a message into Bob's signatures on the same message, and presents new formal definitions, algorithms, and motivating applications for three natural cryptographic constructions. Expand

Self-certified digital signatures

- 2011

Digital signatures are used for proving the authorship of a given message. It is an important primitive of modern cryptography. To verify a signature, a user has to be equipped with a valid public… Expand

A public key cryptosystem and signature scheme based on numerical series

- Computer Science
- 2020

The experimental results show the superiority of the proposed key exchange algorithm and public key cryptosystem as it provides forward secrecy and using large size symmetric keys to encrypt and decrypt messages in significantly short time. Expand

New Convertible Authenticated Encryption Scheme with Message Linkages

- Computer Science
- 2015

This thesis presents a convertible authenticated encryption scheme that can produce the ordinary signature without the cooperation of the signer with a greater ease and displays a validated encryption plan using message linkages used to convey a message. Expand

#### References

SHOWING 1-10 OF 20 REFERENCES

An Improved Algorithm for Computing Logarithms over GP(p) and Its Cryptographic Significance

- Computer Science
- 1973

An improved algorithm is derived which requires O(log2 p) complexity if p 1 has only small prime factors and such values of p must be avoided in the cryptosystem. Expand

New directions in cryptography

- Computer Science
- IEEE Trans. Inf. Theory
- 1976

This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing. Expand

An Introduction to the Theory of Numbers

- Nature
- 1946

THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers.… Expand

Theorems on factorization and primality testing

- Computer Science
- 1974

This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n or test it for primality, and uses a multi-tape Turing machine for this purpose. Expand

Some Cryptographic Applications of Permutation Polynomials

- Computer Science
- Cryptologia
- 1977

Various ways to use permutation polynomials, defined on a finite field and more generally rational permutation functions, to construct cryptographic systems of a general mathematical nature are discussed. Expand

Riemann's Hypothesis and tests for primality

- Computer Science, Mathematics
- STOC
- 1975

It is shown that primality is testable in time a polynomial in the length of the binary representation of a number, and a partial solution is given to the relationship between the complexity of computing the prime factorization of a numbers, computing the Euler phi function, and computing other related functions. Expand

A Fast Monte-Carlo Test for Primality

- Mathematics, Computer Science
- SIAM J. Comput.
- 1977

A uniform distribution a from a uniform distribution on the set 1, 2, 3, 4, 5 is a random number and if a and n are relatively prime, compute the residue varepsilon. Expand

The Federal Register.

- Medicine
- Journal of clinical ultrasound : JCU
- 1979

This notice updates the FY 2017 FMRs for Portland, ME HUD Metro FMR Area (HMFA) and VallejoFairfield, CA Metropolitan Statistical Area (MSA), as requested by commenters and provides responses to the public comments HUD received on the previous notice referenced above. Expand

Exhaustive cryptanalysis of the NBS data encryption standard

- Computer
- 1977

Exhaustive cryptanalysis of the NBS data encryption standard

- Computer
- 1977