A method for obtaining digital signatures and public-key cryptosystems

  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},
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… 

Tables from this paper

A Modified RSA Encryption Technique Basedon Multiple public keys

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.

Probabilistic cryptosystem with two pairs of private/public keys

  • Reem Alfaifi
  • Computer Science, Mathematics
    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.

An Efficient Key Distribution Protocol Based on BB84

  • P. Lala
  • Computer Science, Mathematics
  • 2014
A key distribution protocol based on the concepts of BB84 is proposed that provides an additional layer of security by sending the key data bits twice; during the second transmission the original key bits or their complements are randomly chosen for transmission.

Modified RSA Encryption Algorithm (MREA)

  • R. DhakarA. GuptaP. Sharma
  • Computer Science, Mathematics
    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.

Secure Data Communication using Cryptography and Steganography Standards

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.

An Implementation of Data Security by using Both Cryptography and Steganography Algorithms on FPGA

In today’s world, security is done through networks which are used to transmit confidential information. Security is demanding in a wide range of applications. Cryptographic algorithms play an

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

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.

Self-certified digital signatures

  • Nan Li
  • Computer Science, Mathematics
  • 2011
This thesis provides an efficient and novel self-certified signature scheme, which requires only one modular multiplication in signing with pre-computation, and is proved to be secure in the random oracle model.

New Convertible Authenticated Encryption Scheme with Message Linkages

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.

An algorithm to enhance security in RSA

This paper proposes a secure algorithm that tries to eliminate the distribution of n which is the large number whose factors if found compromises the RSA algorithm.



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

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.

New Directions in Cryptography

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.

An Introduction to the Theory of Numbers

  • E. T.
  • Mathematics
  • 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.

Some Cryptographic Applications of Permutation Polynomials

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.

Riemann's Hypothesis and tests for primality

  • G. Miller
  • Computer Science, Mathematics
  • 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.

A Fast Monte-Carlo Test for Primality

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.

The Federal Register.

  • G. Leopold
  • Computer Science
    Journal of clinical ultrasound : JCU
  • 1979
This final rule allows the use of portable fire extinguishers in working sections of underground anthracite coal mines that have no electrical equipment at the working section and produce less than 300 tons of coal per shift.

Theorems on factorization and primality testing

  • J. Pollard
  • Computer Science
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 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.

A comment on this article may be found in the Technical Correspondence section of this issue

  • Federal Register

The Art of Computer Programming Seminumerical Algorithms

  • The Art of Computer Programming Seminumerical Algorithms
  • 1969