Skip to main content

Secret Agents Leave Big Footprints: How to Plant a Cryptographic Trapdoor, and Why You Might Not Get Away with It

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2724))

Included in the following conference series:

Abstract

This paper investigates whether optimisation techniques can be used to evolve artifacts of cryptographic significance which are apparently secure, but which have hidden properties that may facilitate cryptanalysis. We show how this might be done and how such sneaky use of optimisation may be detected.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  5. C. Ding, G. Xiao, and W. Shan. The Stability of Stream Ciphers, volume 561 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

    MATH  Google Scholar 

  6. Giddy J.P. and Safavi-Naini R. Automated Cryptanalysis of Transposition Ciphers. The Computer Journal, XVII(4), 1994.

    Google Scholar 

  7. S. Kirkpatrick, Jr. C. D. Gelatt, and M. P. Vecchi. Optimization by Simulated Annealing. Science, 220(4598):671–680, May 1983.

    Article  MathSciNet  Google Scholar 

  8. Robert A J Mathews. The Use of Genetic Algorithms in Cryptanalysis. Cryptologia, XVII(2):187–201, April 1993.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  11. National Bureau of Standards. Data Encryption Standard. NBS FIPS PUB 46, 1976.

    Google Scholar 

  12. Bruce Schneier. Applied Cryptography. Wiley, 1996.

    Google Scholar 

  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.

    Google Scholar 

  14. Forsyth W.S. and Safavi-Naini R. Automated Cryptanalysis of Substitution Ciphers. Cryptologia, XVII(4):407–418, 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clark, J.A., Jacob, J.L., Stepney, S. (2003). Secret Agents Leave Big Footprints: How to Plant a Cryptographic Trapdoor, and Why You Might Not Get Away with It. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-45110-2_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40603-7

  • Online ISBN: 978-3-540-45110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics