A method for obtaining digital signatures and public-key cryptosystems
Explore this paper's citation graph
Summary
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
- Type
- article
- Published
- 1978-02-01
- Cited by
- 15,410
- References
- 17
- Access
- Open access
- OpenAlex
- https://openalex.org/W1996360405
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:30798417
Keywords
Encryption, Computer science, Digital signature, Key (lock), Public-key cryptography
References
- A Fast Monte-Carlo Test for Primality
- Some Cryptographic Applications of Permutation Polynomials
- An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.)
- Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
- Riemann's Hypothesis and tests for primality
- Secure communications over insecure channels
- An Introduction to the Theory of Numbers
- Theorems on factorization and primality testing
- New Directions in Cryptography
- The Art of Computer Programming, Volume II: Seminumerical Algorithms
- The Art of Computer Programming
- Electronic mail
- The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
- An Introduction To The Theory Of Numbers
Cited by
- AST Pre-Processing For The Sliding Window Method Using Genetic Algorithms
- Anchoring Students Metaperspective Discussions of History in Mathematics
- Secure Processing Offload in Recombining Media Segments for Mobile Access
- A symmetric cipher not requiring prior sender/receiver key agreement
- A Secure and Practical Electronic Voting Scheme for Real World Environments
- LONG-TERM SECURITY VULNERABILITIES OF ENCRYPTED DATA
- Implementation and analysis
- Scalability, Accountability and Instant Information Access for Network-Centric Warfare
- An Enhanced Approach to using Virtual Directories for Protecting Sensitive Information
- Arithmétique modulaire pour la cryptographie
- GSM Security II
- A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
- FPGA based communication security for wireless sensor networks
- Fast modular exponentiation using residue domain representation: A hardware implementation and analysis
- A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomophism
- A fully automated quantum cryptography system based on entanglement for optical fibre networks
- Generating One-Time Passwords by Cheap and Fast Devices
- INFINITUDE OF ELLIPTIC CARMICHAEL NUMBERS
- Study of security aspects for Session Initiation Protocol
- Hash Functions and Gröbner Bases Cryptanalysis
Related papers
- 차분 혼합 알고리즘을 이용한 전자상거래 문서의 디지털 서명에 관한 연구
- Design and analysis of Chameleon signature scheme with time limit
- Post-quantum signatures for today
- Information Hiding in the RSA Modulus
- A New Attack Method on Digital Signature Scheme
- Digital Signature Based On Public Key
- On functionality extension of the digital signature standards
- Security of the Cao-Li Public Key Cryptosystem
- Study of Multi Digital Signature Based on RSA Public Key System