Two-stage optimisation in the design of Boolean functions

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

Volumn 1841, Issue , 2000, Pages 242-254

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

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; OPTIMIZATION; SECURITY OF DATA; SIMULATED ANNEALING;

HILL CLIMBING; OPTIMISATION METHOD; OPTIMISATIONS; TRADITIONAL TECHNIQUES;

BOOLEAN FUNCTIONS;

EID: 84958973763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10718964_20     Document Type: Conference Paper

References (12)

1. W.S. Forsyth and R. Safavi-Naini. Automated Cryptanalysis of Substitution Ciphers. Cryptologia. vol. 17. No 4. 1993. pp407-418.
2. J.P. Giddy and R. Safavi-Naini Automated Cryptanalysis of Transposition Ciphers. The Computer Journal, (17)4, 1994.
3. X.-D Hou. On the Norm and Covering Radius of First-order Reed-Muller Codes. IEEE Transactions on Information Theory, 43(3). May 1983. pp.354-356.
4. S. Kirkpatrick and C. D. Gelatt, Jr. and M. P. Vecchi. Optimization by Simulated Annealing. Science, May 1993. pp. 671-680
5. Lars R. Knudsen and Willi Meier. Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem. In Advances in Cryptology Eurocrypt '99, Springer Verlag LNCS 1592 pp. 363-374
6. Robert A J Mathews. The Use of Genetic Algorithms in Cryptanalysis. Cryptologia (17)2, April 1993. pp187-201
7. William Millan, Andrew Clark and Ed Dawson. An Effective Genetic Algorithm for Finding Highly Non-linear Boolean Functions. In Proceedings of the First International Conference on Information and Communications Security, 1997. Springer Verlag LNCS 1334. pp149-158
8. William Millan, Andrew Clark and Ed Dawson. Heuristic Design of Crypto-graphically Strong Balanced Boolean Functions. In Advances in Cryptology EU-ROCRYPT'98, Springer Verlag LNCS 1403. pp.489-499
9. William Millan, Andrew Clark and Ed Dawson. Boolean Function Design Using Hill-climbing Methods. Australian Conference on Information Security and Privacy (ACISP). 1999. pp.1-11
10. National Bureau of Standards. NBS FIPS PUB 46.Data Encryption Standard. 1976.
11. N.J. Patterson and D.H. Weidermann. The Covering Radius of the (21B, 16) Reed-Muller Code is at Least 16276. IEEE Transactions on Information Theory, 29(3). May 1997. pp.1025-1027.
12. Richard Spillman and Mark Janssen and Bob Nelson and Martin Kepner. The Use of A Genetic Algorithm in the Cryptanalysis of Simple Substitution Ciphers. Cryptologia (17)1. April 1993. pp. 187-201