Abstract
This paper outlines a general approach to the iterative incremental improvement of the cryptographic properties of arbitrary Boolean functions. These methods, which are known as hill climbing, offer a fast way to obtain Boolean functions that have properties superior to those of randomly generated functions. They provide a means to improve the attainable compromise between conflicting cryptographic criteria. We give an overview of the different options available, concentrating on reducing the maximum value of the Walsh-Hadamard transform and autocorrelation function. A user selected heuristic allows the methods to be flexible. Thus we obtain Boolean functions that are locally optimal with regard to one or more important cryptographic properties such as nonlinearity and global autocorrelation.
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
E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology-Crypto’ 90, Proceedings, volume 537 of Lecture Notes in Computer Science, pages 2–21. Springer-Verlag, 1991.
C. Carlet. Partially-Bent Functions. In Advances in Cryptology-Crypto’ 92, Proceedings, volume 740 of Lecture Notes in Computer Science, pages 280–291. Springer-Verlag, 1993.
M. Matsui. Linear Cryptanalysis Method for DES Cipher. In Advances in Cryptology-Eurocrypt’ 93, Proceedings, volume 765, pages 386–397. Springer-Verlag, 1994.
W. Meier and O. Staffelbach. Nonlinearity Criteria for Cryptographic Functions. In Advances in Cryptology-Eurocrypt’ 89, Proceedings, volume 434, pages 549–562. Springer-Verlag, 1990.
W. Millan, A. Clark, and E. Dawson. An Effective Genetic Algorithm for Finding Highly Nonlinear Boolean Functions. In First International Conference on Information and Communications Security, ICICS’97, volume 1334 of Lecture Notes in Computer Science, pages 149–158. Springer-Verlag, 1997.
W. Millan, A. Clark, and E. Dawson. Smart Hill Climbing Finds Better Boolean Functions. In Workshop on Selected Areas in Cryptology 1997, Workshop Record, pages 50–63, 1997.
W. Millan, A. Clark, and E. Dawson. Heuristic Design of Cryptographically Strong Balanced Boolean Functions. In Advances in Cryptology-Eurocrypt’ 98, Proceedings, volume 1403 of Lecture Notes in Computer Science, pages 489–499. Springer-Verlag, 1998.
O.S. Rothaus. On Bent Functions. Journal of Combinatorial Theory (A), 20:300–305, 1976.
X.-M. Zhang and Y. Zheng. Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions. In Advances in Cryptology-Eurocrypt’ 96, Proceedings, volume 1070 of Lecture Notes in Computer Science, pages 294–306. Springer-Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Millan, W., Clark, A., Dawson, E. (1999). Boolean Function Design Using Hill Climbing Methods. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 1999. Lecture Notes in Computer Science, vol 1587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48970-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-48970-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65756-9
Online ISBN: 978-3-540-48970-2
eBook Packages: Springer Book Archive