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

Authors:
John A. Clark;Jeremy L. Jacob;Susan Stepney
Affiliations:
Department of Computer Science, University of York, York, U.K.;Department of Computer Science, University of York, York, U.K.;Department of Computer Science, University of York, York, U.K.
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 6
Cited 0

Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers

Cryptologia
Two-Stage Optimisation in the Design of Boolean Functions

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
An effective genetic algorithm for finding highly nonlinear Boolean Functions

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Fault Injection and a Timing Channel on an Analysis Technique

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Evolving Boolean Functions Satisfying Multiple Criteria

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

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.