A method for obtaining digital signatures and public-key cryptosystems
- 1 January 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (1), 96-99
- https://doi.org/10.1145/357980.358017
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Secure communications over insecure channelsCommunications of the ACM, 1978
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption StandardComputer, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- SOME CRYPTOGRAPHIC APPLICATIONS OF PERMUTATION POLYNOMIALSCryptologia, 1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- RegisterPublished by Walter de Gruyter GmbH ,1975
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974