Uniform complexity and digital signatures
- 1 January 1981
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 16 (1), 99-110
- https://doi.org/10.1016/0304-3975(81)90034-7
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Encryption and Secure Computer NetworksACM Computing Surveys, 1979
- Cryptology in TransitionACM Computing Surveys, 1979
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- On digital signaturesACM SIGOPS Operating Systems Review, 1978
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Complexity of computationsCommunications of the ACM, 1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Computational complexity of probabilistic Turing machinesPublished by Association for Computing Machinery (ACM) ,1974
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970