Evolutionary Computation in computer security and cryptography

[1]  H. Feistel.  Cryptography and Computer Privacy , 1973 .

[2]  W. Kinzel,et al.  Secure exchange of information by synchronization of neural networks , 2002 .

[3]  Richard Spillman,et al.  Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms , 1993, Cryptologia.

[4]  Alan T. Sherman,et al.  How to Break Gifford's Cipher , 1997, Cryptologia.

[5]  Marco Tomassini,et al.  Co-evolving Parallel Random Number Generators , 1996, PPSN.

[6]  Andrew J. Clark,et al.  A Parallel Genetic Algorithm for Cryptanalysis of the Polyalphabetic Substitution Cipher , 1997, Cryptologia.

[7]  S. Wolfram.  Random sequence generation by cellular automata , 1986 .

[8]  José María Sierra,et al.  Genetic Cryptoanalysis of Two Rounds TEA , 2002, International Conference on Computational Science.

[9]  John M. Carroll,et al.  The Automated Cryptanalysis of Polyalphabetic Ciphers , 1987, Cryptologia.

[10]  William Millan,et al.  An effective genetic algorithm for finding highly nonlinear Boolean Functions , 1997, ICICS.

[11]  Willi Meier,et al.  Analysis of Pseudo Random Sequence Generated by Cellular Automata , 1991, EUROCRYPT.

[12]  John A. Clark,et al.  Fault Injection and a Timing Channel on an Analysis Technique , 2002, EUROCRYPT.

[13]  Thomas P. Jakobsen,et al.  A Fast Method for the Cryptanalysis of Substitution Ciphers , 1995 .

[14]  G. Athithan,et al.  An Automated Approach to Solve Simple Substitution Ciphers , 1993, Cryptologia.

[15]  Azriel Rosenfeld,et al.  Breaking substitution ciphers using a relaxation algorithm , 1979, CACM.

[16]  Reihaneh Safavi-Naini,et al.  Automated Cryptanalysis of Transposition Ciphers , 1994, Comput. J..

[17]  Adi Shamir,et al.  Analysis of Neural Cryptography , 2002, ASIACRYPT.

[18]  Joos Vandewalle,et al.  Efficient pseudorandom sequence generation by cellular automata , 1991 .

[19]  Alan T. Sherman,et al.  Statistical Techniques for Language Recognition: an Introduction and Guide for Cryptanalysts , 1993, Cryptologia.

[20]  Richard Spillman,et al.  Use of a genetic algorithm in the crypt-analysis of simple substitution ciphers , 1993 .

[21]  Alan T. Sherman,et al.  How to break Gifford's cipher (extended abstract) , 1994, CCS '94.

[22]  Joos Vandewalle,et al.  A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgård's One-Way Function Based on a Cellular Automaton , 1991, ASIACRYPT.

[23]  Marco Tomassini,et al.  Generating Parallel Random Number Generators By Cellular Programming , 1996 .

[24]  J.C. Hernandez,et al.  Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[25]  David Wagner,et al.  A Programmable Plaintext Recognizer , 1994 .

[26]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[27]  D. G. N. Hunter,et al.  Experiments with Relaxation Algorithms for Breaking Simple Substitution Ciphers , 1983, Comput. J..

[28]  Wolfgang Kinzel,et al.  Cryptography based on neural networks—analytical results , 2002 .

[29]  Reihaneh Safavi-Naini,et al.  Automated Cryptanalysis of Substitution Ciphers , 1993, Cryptologia.

[30]  Réjane Forré,et al.  The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition , 1988, CRYPTO.

[31]  John M. Carroll,et al.  The Automated Cryptanalysis of Substitution Ciphers , 1986, Cryptologia.

[32]  Wolfgang Kinzel,et al.  Learning and predicting time series by neural networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.

[34]  David Pointcheval,et al.  A New Identification Scheme Based on the Perceptrons Problem , 1995, EUROCRYPT.

[35]  Victor J. Rayward-Smith,et al.  The Cryptanalysis of a Three Rotor Machine Using a Genetic Algorithm , 1997, ICGA.

[36]  John C. King.  An Algorithm for the Complete Automated Cryptanalysis of Periodic Polyalphabetic Substitution Ciphers , 1994, Cryptologia.

[37]  Dennis R. Bahler,et al.  An Implementation of Probabilistic Relaxation in the Cryptanalysis of Simple Substitution Ciphers , 1992, Cryptologia.

[38]  Steven Guan,et al.  An evolutionary approach to the design of controllable cellular automata structure for random number generation , 2003, IEEE Trans. Evol. Comput..