A note on the complexity of cryptography (Corresp.)
- 1 March 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (2) , 232-233
- https://doi.org/10.1109/tit.1979.1056010
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971