Cryptocomplexity and NP-completeness
- 1 January 1980
- book chapter
- Published by Springer Nature
- p. 195-207
- https://doi.org/10.1007/3-540-10003-2_71
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Cryptology in TransitionACM Computing Surveys, 1979
- Relativized cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A note on the complexity of cryptography (Corresp.)IEEE Transactions on Information Theory, 1979
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Partial algorithm problems for context free languagesInformation and Control, 1967