On the Evolution of Boolean Functions with the Algebraic Normal Form Representation
Pages 639 - 642
Abstract
This work investigates the evolution of Boolean functions represented with the algebraic normal form (ANF) representation. This novel direction allows for a better "fit" between the representations and properties but also presents some challenges. Our experimental evaluation shows that ANF representation works well and can find highly nonlinear (balanced) functions. Our results indicate that the bitstring encoding with the algebraic normal form representation can perform better than the bitstring encoding with the truth table representation, which is the most common approach in the literature.
References
[1]
Claude Carlet. 2021. Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge.
[2]
Claude Carlet, Domagoj Jakobovic, and Stjepan Picek. 2021. Evolutionary algorithms-assisted construction of cryptographic boolean functions. In Proceedings of the Genetic and Evolutionary Computation Conference (Lille, France) (GECCO '21). Association for Computing Machinery, New York, NY, USA, 565--573.
[3]
John A. Clark and Jeremy L. Jacob. 2000. Two-Stage Optimisation in the Design of Boolean Functions. In Information Security and Privacy, E. P. Dawson, A. Clark, and Colin Boyd (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 242--254.
[4]
J. A. Clark, J. L. Jacob, S. Maitra, and P. Stănică. 2003. Almost Boolean functions: the design of Boolean functions by spectral inversion. In The 2003 Congress on Evolutionary Computation, 2003. CEC '03., Vol. 3. 2173--2180 Vol.3.
[5]
Marko Djurasevic, Domagoj Jakobovic, Luca Mariot, and Stjepan Picek. 2023. A survey of metaheuristic algorithms for the design of cryptographic Boolean functions. Cryptography and Communications 15, 6 (July 2023), 1171--1197.
[6]
Joanne Fuller, Ed Dawson, and William Millan. 2003. Evolutionary generation of bent functions for cryptography. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, Canberra, Australia, December 8--12, 2003. IEEE, 1655--1661.
[7]
Seluk Kavut, Subhamoy Maitra, and Melek D. Yucel. 2007. Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class. IEEE Transactions on Information Theory 53, 5 (2007), 1743--1751.
[8]
F. Jessie MacWilliams and Neil J. A. Sloane. 1977. The Theory of Error-Correcting Codes. Elsevier, Amsterdam, North Holland. 782 pages. ISBN: 978-0-444-85193-2.
[9]
Luca Mariot and Alberto Leporati. 2015. A Genetic Algorithm for Evolving Plateaued Cryptographic Boolean Functions. In Theory and Practice of Natural Computing, Adrian-Horia Dediu, Luis Magdalena, and Carlos Martín-Vide (Eds.). Springer International Publishing, Cham, 33--45.
[10]
William Millan, Andrew Clark, and Ed Dawson. 1997. An effective genetic algorithm for finding highly nonlinear boolean functions. In Information and Communications Security, Yongfei Han, Tatsuaki Okamoto, and Sihan Qing (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 149--158.
[11]
Stjepan Picek, Domagoj Jakobovic, and Marin Golub. 2013. Evolving Cryptographically Sound Boolean Functions. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation (Amsterdam, The Netherlands) (GECCO '13 Companion). Association for Computing Machinery, New York, NY, USA, 191--192.
[12]
Stjepan Picek, Domagoj Jakobovic, Julian F. Miller, Elena Marchiori, and Lejla Batina. 2015. Evolutionary Methods for the Construction of Cryptographic Boolean Functions. Springer International Publishing, 192--204.
[13]
Riccardo Poli, William B. Langdon, and Nicholas Freitag McPhee. 2008. A Field Guide to Genetic Programming. lulu.com.
[14]
Z. Saber, Mohammad Faisal Uddin, and Amr M. Youssef. 2006. On the existence of (9, 3, 5, 240) resilient functions. IEEE Trans. Information Theory 52, 5 (2006), 2269--2270.
[15]
Pantelimon Stănică, Subhamoy Maitra, and John A. Clark. 2004. Results on Rotation Symmetric Bent and Correlation Immune Boolean Functions. In Fast Software Encryption, 11th International Workshop, FSE 2004, Delhi, India, February 5--7, 2004, Revised Papers (Lecture Notes in Computer Science, Vol. 3017), Bimal K. Roy and Willi Meier (Eds.). Springer, Berlin, Heidelberg, 161--177.
[16]
Min Yang, Qingshu Meng, and Huanguo Zhang. 2005. Evolutionary Design of Trace Form Bent Functions. Cryptology ePrint Archive, Paper 2005/322. https://eprint.iacr.org/2005/322 https://eprint.iacr.org/2005/322.
Index Terms
- On the Evolution of Boolean Functions with the Algebraic Normal Form Representation
Recommendations
Boolean functions optimizing most of the cryptographic criteria
In this paper, we construct a class of 2 k -variable Boolean functions which have optimal algebraic degree, very high nonlinearity, optimal algebraic immunity, and are 1 -resilient. These properties are unconditional except the algebraic immunity ...
Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity
Recent research shows that the class of rotation symmetric Boolean functions is potentially rich in functions of cryptographic significance. In this paper, based on the knowledge of compositions of an integer, we present two new kinds of construction of ...
A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
In this paper, a combinatorial conjecture about binary strings is proposed. Under the assumption that the proposed conjecture is correct, two classes of Boolean functions with optimal algebraic immunity can be obtained. The functions in first class are ...
Comments
Information & Contributors
Information
Published In
July 2024
2187 pages
Copyright © 2024 Copyright held by the owner/author(s).
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 2024
Check for updates
Author Tags
Qualifiers
- Poster
Conference
GECCO '24 Companion
Sponsor:
GECCO '24 Companion: Genetic and Evolutionary Computation Conference Companion
July 14 - 18, 2024
VIC, Melbourne, Australia
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 54Total Downloads
- Downloads (Last 12 months)54
- Downloads (Last 6 weeks)12
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in