참고문헌
- P. Isasi and J. C. Hernandez, 'Introduction to the applications of evolutionary computation in computer security and crytography,' Computational Intelligence, Vol. 20, No. 3, pp. 445-449, 2004
- S. Peleg and A. Rosenfeld, 'Breaking substitution ciphers using a relaxation algorithm,' Communications of the ACM, Vol. 22, No. 11, pp. 598-605, 1979
- D. G. B. Hunter and A. R. Mckenzie, 'Experiments with relaxation algorithms for breaking simple substitution ciphers,' The Computer Journal, Vol. 26, No. 1, pp. 68-71, 1983
- J. M. Carroll and S. Martin, 'The automated cryptanalysis of substitution ciphers,' Cryptologia, Vol. 10, No. 4, pp. 193-209, 1986
- J. C. King and D. R. Bahler, 'An implementation of probabilistic relaxation in the cryptanalysis of simple substitution ciphers,' Cryptologia, Vol. 16, No. 3, pp. 215-225, 1992
- J. C. King, 'An algorithm for the complete cryptanalysis of periodic polyalphabetic substitution ciphers, Cryptologia, Vol. 18, No. 4, pp. 332-355, 1994
- A. Clark and E. Dawson, 'A parallel genetic algorithm for cryptanalysis of the polyalphabetic substitution cipher,' Cryptologia, Vol. 21, No. 2, pp. 129-138, 1997
- R. Spillma, M. Janssen, B. Nelson and M. Kepner, 'Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers,' Cryptologia, Vol. 17, No. 1, pp. 31-44, 1993
- W. S. Forsyth, and R. Safavi-Naini, 'Automated cryptanalysis of substitution ciphers,' Cryptologia, Vol. 17, No. 4, pp. 407-418, 1993
- A. J. Bagnall, G. P. McKeown, and V. J. Rayward-Smith, 'The cryptanalysis of a three rotor machine using a genetic algorithm,' Proceedings of the 7th International Conference on Genetics Algorithms ICGA '97, Morgan-Kaufmann, pp. 712-718, 1997
- W. Millan et al., 'New Concepts in Evolutionary Search for Boolean Functions in Cryptology,' IEEE Proceedings, 2003
- I. A. Clark et al. 'Almost Boolean Functions: the Design of Boolean Functions by Spectral Inversion,' IEEE Proceedings, 2003
- J. Von Neumann, The theory of self reproducing cellular automata, University of Illinois Press, Urbana, Illinois, 1967
- S. Wolfram, 'Random sequence generation by cellular automata,' Advances in Applied Mathematics, Vol. 7, No. 2, pp. 123-169, 1986
- M. Sipper and M. Tomassini, 'Generating parallel random number generators by cellular programming, Int. J. Mod. Phys, Vol. 7, No. 2, pp. 181-190, 1996
- Sheng-Uei, and S. Zhang, 'An evolutionary approach to the design of controllable cellular automata structure for random number generation,' IEEE Transactions on Evolutionary Computation. Vol. 7, No. 1, pp. 23-36, 2003
- Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997
- Sheng-Uei Guan and Shu Zhang, 'An Evolutionary Approach to the Design of Controllable Cellular Automata Structure for Random Number Generation,' IEEE Transactions on evolutionary computation, Vol. 7, No. 1, pp. 23-36, 2003
- M. Mihaljevic, Y. Zheng. and H. ImaiA Cellular Automata based Fast One-Way Hash Function Suitable for Hardware Implementation.' Public Key Cryptography- Proceedings of PKC'98, LNCS. Vol. 1431, pp. 217-233, 1998
- S. Wolfram, A New Kind of Science Wolfram Media, pp. 435-441, 2002
- F. Seredynski, P. Bouvry, and A. Y. Zomaya, 'Cellular Programming and Symetric Key Cryptography Systems, Genetic and Evolutionary Computation (GECCO), LNCS 2724, Part II, pp. 1369-1381, 2003
-
P. Pal. Choudhury and R. Barua, 'Cellular Automata Based VLSI Architecture for Computing Multiplication And Inverses In GF(
$2^m$ ),' IEEE 7th International Conference on VLSI Design. pp. 279-282. 1994 - J. C. Jeon and K. Y. Yoo, 'Design of Montgomery Multiplication Architecture Based on Programmable Cellular Automata,' Computational Intelligence, Vol, 20. No. 3, pp. 495-502, 2004
- R. Alonso-Sanz, and M. Martin, 'One-dimensional cellular automata with memory: patterns from a single site seed,' International Journal of Bifurcation and Chaos Applied Sciences and Engineering, pp. 205-226, 2002
- G. Alvarez Maranon, L. Hernandez Encinas, and A. Martin del Rey, 'Sharing secret color images using cellular automata with memory, arXiv. org e-Piint, CR/0312034, 2003