Cryptocomplexity and NP-completeness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 85 LNCS, Issue , 1980, Pages 195-207

  Even, S ^a   Yacobi, Y ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CRACKS; CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

CRACKING PROBLEM; KNAPSACK PROBLEMS; NP-COMPLETENESS; NP-HARD; NP-HARDNESS; PUBLIC KEY CRYPTOSYSTEMS;

PROBLEM SOLVING;

EID: 85009782374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10003-2_71     Document Type: Conference Paper

References (14)

1. Diffie, W. and Hellman, M. E., “New Directions in Cryptography”, IEEE Transactions on Information Theory, Vol. 22, 1976, pp. 644–654.
2. Brassard, G., Fortune, S., and Hopcroft, J., “A Note on Cryptography and NP ∩ CoNP-P”, TR78-338, Dept. of Comp. Sci., Cornell University.
3. Karp, R. M., “Reducibility Among Combinatorial Problems”, in R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, 1972, pp. 85–104.
4. Garey, M. R., and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979.
5. Aho, A. V., Hopcroft, J. E. and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
6. Even, S., Graph Algorithms, Computer Science Press, 1979.
7. Lempel, A., “Cryptology in Transition”, Computing Surveys, December 1979.
8. Cook, S. A., “The Complexity of Theorem Proving Procedures”, Proceedings 3rd Am. ACM Symposium on Theory of Computing, ACM, 1971, pp. 151–158.
9. Rivest, R. L., Shamir, A., and Adleman, L., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Comm. ACM 21, February 1978, pp. 120–126.
10. Merkle, R., and Hellman, M., “Hiding Information and Signatures in Trapdoor Knapsack”, IEEE Transactions on Information Theory. Vol. IT-24, September 1978, pp. 525–530.
11. Brassard, G., “A Note on the Complexity of Cryptography”, IEEE Transactions on Information Theory. Vol. IT-25, March 1979, pp. 232–233.
12. Ginsburg, S., private communication.
13. Ullian, J. S., “Partial Algorithm Problems for Context Free Languages”. Information and Control, Vol. 11, 1967, pp. 80–101.
14. Brassard, G., “Relativized Cryptography”. Proceedings of 20th FOCS, Puerto Rico 1979.