 |
    |
Combining Evolutionary Computation and Algebraic Constructions to Find Cryptography-Relevant Boolean Functions
Stjepan Picek1,2, Elena Marchiori1, Lejla Batina1, and Domagoj Jakobovic2
1Radboud University Nijmegen, Institute for Computing and Information Sciences, Postbus 9010, 6500 GL, Nijmegen, The Netherlands
2Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, Zagreb, Croatia
Abstract. Boolean functions play a central role in security applications because they constitute one of the basic primitives for modern cryptographic services. In the last decades, research on Boolean functions has been boosted due to the importance of security in many diverse public systems relying on such technology. A main focus is to find Boolean functions with specific properties. An open problem in this context is to find a balanced Boolean function with an 8-bit input and nonlinearity 118. Theoretically, such a function has been shown to exist, but it has not been found yet. In this work we focus on specific classes of Boolean functions, and analyze the landscape of results obtained by integrating algebraic and evolutionary computation (EC) based approaches. Results indicate that combinations of these approaches give better results although not reaching 118 nonlinearity.
Keywords: Boolean Functions, Nonlinearity, Evolutionary Computation, Bent Functions, Cryptographic Properties
LNCS 8672, p. 822 ff.
lncs@springer.com
© Springer International Publishing Switzerland 2014