Abstract
This paper shows how suitable choice of cost function can significantly affect the power of optimisation methods for the synthesising of Boolean functions. In particular we show how simulated annealing, coupled with a new cost function motivated by Parseval’s Theorem, can be used to drive the search into areas of design from which traditional techniques, such as hill-climbing, can find then find excellent solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Forsyth, W.S., Safavi-Naini, R.: Automated Cryptanalysis of Substitution Ciphers. Cryptologia XVII(4), 407–418 (1993)
Giddy, J.P., Safavi-Naini, R.: Automated Cryptanalysis of Transposition Ciphers. The Computer Journal 4(XVII) (1994)
Hou, X.-D.: On the Norm and Covering Radius of First-order Reed Muller Codes. IEEE Transactions on Information Theory 43(3), 354–356 (1983)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science, 671–680 (May 1993)
Knudsen, L.R., Meier, W.: Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 363–374. Springer, Heidelberg (1999)
Mathews, R.A.J.: The Use of Genetic Algorithms in Cryptanalysis. Cryptologia (XVII)2, 187–201 (1993)
Millan, W., Clark, A., Dawson, E.: An Effective Genetic Algorithm for Finding Highly Non-linear Boolean Functions. In: Proceedings of the First International Conference on Information and Communications Security. LNCS, vol. 1334, pp. 149–158. Springer, Heidelberg (1997)
Millan, W., Clark, A., Dawson, E.: Heuristic Design of Cryptographically Strong Balanced Boolean Functions. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 489–499. Springer, Heidelberg (1998)
Millan, W., Clark, A., Dawson, E.: Boolean Function Design Using Hill-climbing Methods. In: Australian Conference on Information Security and Privacy (ACISP), pp. 1–11 (1999)
National Bureau of Standards. NBS FIPS PUB 46. Data Encryption Standard (1976)
Patterson, N.J., Weidermann, D.H.: The Covering Radius of the (215, 16) Reed-Muller Code is at Least 16276. IEEE Transactions on Information Theory 29(3), 1025–1027 (1997)
Spillman, R., Janssen, M., Nelson, B., Kepner, M.: The Use of A Genetic Algorithm in the Cryptanalysis of Simple Substitution Ciphers. Cryptologia (XVII)1, 187–201 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clark, J.A., Jacob, J.L. (2000). Two-Stage Optimisation in the Design of Boolean Functions. In: Dawson, E.P., Clark, A., Boyd, C. (eds) Information Security and Privacy. ACISP 2000. Lecture Notes in Computer Science, vol 1841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10718964_20
Download citation
DOI: https://doi.org/10.1007/10718964_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67742-0
Online ISBN: 978-3-540-45030-6
eBook Packages: Springer Book Archive