Combinatorial optimization and the knapsack cipher

Cryptologia

Volumn 20, Issue 1, 1996, Pages 85-93

  Clark, Andrew ^a,b   Dawson, Ed ^a,b   Bergen, Helen ^a,c  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b Information security research centre   (Australia)

^c ANU Canberra   (Australia)

Author keywords

Automated cryptanalysis; Combinatorial optimization; Genetic algorithms; Knapsack ciphers

Indexed keywords

EID: 84969348926     PISSN: 01611194     EISSN: 15581586     Source Type: Journal    
DOI: 10.1080/0161-119691884807     Document Type: Article

References (10)

1. Forsyth, W. S. and R. Safavi-Naini. 1993. Automated cryptanalysis of substitution ciphers. Cryptologia. 17(4): 407-418.
2. Garey, Michael R. and David S. Johnson. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. Bell Telephone Laboratories, Inc.: Murray Hill NJ USA.
3. Martello, Silvano and Paolo Toth. 1990. Knapsack Problems - Algorithms and Computer Implementations. New York: John Wiley and Sons.
4. Matthews, Robert A. J. 1993. The use of genetic algorithms in cryptanalysis. Cryptologia. 17(2): 187-201.
5. Merkle, Ralph C. and Martin E. Heilman. 1978. Hiding information and signatures in trapdoor knapsacks. IEEE Transactions in Information Theory. IT-24(5): 525-530.
6. O’Connor, Luke J. and Jennifer Seberry. 1988. Public Key Cryptography - Cryptographic Significance of the Knapsack Problem. Laguna Hills CA: Aegean Park Press.
7. Rubin, Frank. 1994. Comments on “cryptanalysis of knapsack ciphers using genetic algorithms”. Cryptologia. 18(2): 153-154.
8. Spillman, Richard. 1993. Cryptanalysis of knapsack ciphers using genetic algorithms. Cryptologia. 17(4): 367-377.
9. Spillman, Richard. 1994. Solving the subset-sum problem with a genetic algorithm. Submitted Paper.
10. Spillman, Richard, Mark Janssen, Bob Nelson, and Martin Kepner. 1993. Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers. Cryptologia. 17(1): 31-44.