Secret agents leave big footprints: How to plant a cryptographic trapdoor, and why you might not get away with it

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

Volumn 2724, Issue , 2003, Pages 2022-2033

  Clark, John A ^a   Jacob, Jeremy L ^a   Stepney, Susan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248855009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45110-2_100     Document Type: Article

References (14)

1. John A Clark and Jeremy L Jacob. Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols. In Proceedings 2000 IEEE Symposium on Research in Security and Privacy, pages 82-95. IEEE Computer Society, May 2000.
2. John A Clark and Jeremy L Jacob. Two Stage Optimisation in the Design of Boolean Functions. In Ed Dawson, Andrew Clark, and Colin Boyd, editors, 5th Australasian Conference on Information Security and Privacy, ACISP 2000, pages 242-254. Springer Verlag LNCS 1841, july 2000.
3. John A Clark and Jeremy L Jacob. Fault Injection and a Timing Channel on an Analysis Technique. In Advances in Cryptology Eurocrypt 2002. Springer Verlag LNCS 1592, 2002.
4. John A Clark, Jeremy L Jacob, Susan Stepney, Subhamoy Maitra, and William Millan. Evolving Boolean Functions Satisfying Multiple Criteria. In Alfred Menezes and Palash Sarkar, editors, INDOCRYPT, volume 2551 of Lecture Notes in Computer Science. Springer, 2002.
5. C. Ding, G. Xiao, and W. Shan. The Stability of Stream Ciphers, volume 561 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
6. Giddy J.P. and Safavi-Naini R. Automated Cryptanalysis of Transposition Ciphers. The Computer Journal, XVII(4), 1994.
7. S. Kirkpatrick, Jr. C. D. Gelatt, and M. P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598):671-680, May 1983.
8. Robert A J Mathews. The Use of Genetic Algorithms in Cryptanalysis. Cryptologia, XVII(2):187-201, April 1993.
9. W. Millan, A. Clark, and E. Dawson. An Effective Genetic Algorithm for Finding Highly Non-linear Boolean Functions. pages 149-158, 1997. Lecture Notes in Computer Science Volume 1334.
10. W. Millan, A. Clark, and E. Dawson. Boolean Function Design Using Hill Climbing Methods. In Bruce Schneier, editor, 4th Australian Conference on Information Security and Privacy. Springer-Verlag, april 1999. Lecture Notes in Computer Science Volume 1978.
11. National Bureau of Standards. Data Encryption Standard. NBS FIPS PUB 46, 1976.
12. Bruce Schneier. Applied Cryptography. Wiley, 1996.
13. Richard Spillman, Mark Janssen, Bob Nelson, and Martin Kepner. Use of A Genetic Algorithm in the Cryptanalysis of Simple Substitution Ciphers. Cryptologia, XVII(1):187-201, April 1993.
14. Forsyth W.S. and Safavi-Naini R. Automated Cryptanalysis of Substitution Ciphers. Cryptologia, XVII(4):407-418, 1993.