A method for obtaining digital signatures and public-key cryptosystems

@article{Rivest1983AMF,
  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={1983},
  volume={26},
  pages={96-99}
}
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… Expand
Enhanced Hybrid Algorithm with DSA and RSA Encryption Algorithm
TLDR
In this research, a combination of both DSA and RSA is proposed as a hybrid link for both protocols as digital signatures are used to detect unauthorized modifications to data and to authenticate the identity of the signatory. Expand
Improvements and New Constructions of Digital Signatures
TLDR
A strongly secure digital signature scheme is constructed in the so-called standard model, which is the most realistic model for security proofs, and the quality of a security proof of a related building block is improved, e.g., to reduce the recommended key length for secure use in practice. Expand
Performance Evaluation of Modified Signcryption Scheme
Before a message is sent out, the sender of the message would sign it using a digital signature scheme and then encrypt the message (and the signature) use a private key encryption algorithm under aExpand
Algorithms for Public Key Cryptosystems: Theory and Application
Publisher Summary This chapter discusses recent advancements in cryptographic techniques, known as public key cryptography, which provides elegant solutions not only to secrecy and authentication,Expand
New Cryptosystem Using Multiple Cryptographic Assumptions
TLDR
A new cryptosystem based on two cryptographic assumptions; quadratic residue and discrete logarithms is designed, which offers a greater security level than schemes based on a single cryptographic assumption. Expand
Robust key authentication scheme resistant to public key substitution attacks
TLDR
This paper proposes a robust key authentication scheme resistant to public key substitution attacks based on discrete logarithms and improves the efficiency of Lee et al.'s scheme. Expand
A Modified and Secured RSA Public Key Cryptosystem Based on “n” Prime Numbers
Cryptography is the study that provides security service. It concerns with confidentiality, integrity, and authentication. Public key cryptography provides an enormous revolution in the field of theExpand
Bi-Deniable Public-Key Encryption Protocol which is Secure against Active Coercive Adversary
We consider a practical public-key deniable encryption protocol based on the RSA cryptosystem. The protocol begins with the authentication of the both parties participating in the protocol (theExpand
Protection of Data and Delegated Keys in Digital Distribution
TLDR
This paper examines secure digital distribution systems, information storage system and information provider system, in which encrypted information is directly transformed into a ciphertext of an admissible user, and shows that the technique of a proxy cryptosystem is useful for establishing these distribution systems. Expand
Non-interactive Public-Key Cryptography
An identity-based non-interactive public key distribution system is presented that is based on a novel trapdoor one-way function allowing a trusted authority to compute the discrete logarithm of aExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
Secure communications over insecure channels
TLDR
This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained, and describes a method which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key. Expand
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)
TLDR
An improved algorithm is derived which requires O =(\log^{2} p) complexity if p - 1 has only small prime factors and such values of p must be avoided in the cryptosystem. Expand
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
TLDR
This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive process of manually cataloging and cataloging individual pieces of data to provide real-time information about their owners. Expand
New directions in cryptography
TLDR
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
Some Cryptographic Applications of Permutation Polynomials
TLDR
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
Theorems on factorization and primality testing
TLDR
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
A Fast Monte-Carlo Test for Primality
TLDR
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
An introduction to the theory of numbers
Divisibility congruence quadratic reciprocity and quadratic forms some functions of number theory some diophantine equations Farey fractions and irrational numbers simple continued fractions primesExpand
Riemann's hypothesis and tests for primality
In this paper we present two algorithms for testing primality of an integer. The first algorithm runs in 0(n1/7) steps; while, the second runs in 0(log4n) step but assumes the Extended RiemannExpand
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid. Expand
...
1
2
...