Abstract
In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered as a Boolean function with some undefined (unknown) values, i.e. its values are from the set 0,1,?. We generalize certain cryptographic properties to PDBFs, such as balancedness, nonlinearity and propagation characteristics. It is shown that usual relationships among properties hold for these generalizations as well. We apply these results to methods for generating cryptographically strong Boolean functions. We focus on greedy approach and test it in various settings. The paper compares obtained results with other methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Millan, A. Clark and E. Dawson, Smart hill climbing finds better Boolean functions 4th Workshop on Selected Areas in Cryptography–SAC '97, 1997.
W. Millan, A. Clark and E. Dawson, Heuristic design of cryptographically strong bal anced Bool ean functions Springer-Verlag, LNCS 1403, 1998.
J. A. Clark and J. L. Jacob, Two-stage optimisation in the design of Boolean functions Springer-Verlag, LNCS 1841, 2000.
E. Pasalic and T. Johansson, Further results on the relation between nonlinearity and resiliency for Boolean functions IMA Conference on Cryptography and Coding, Springer-Verlag, LNCS 1746, 1999.
L. Satko, O. Grošek and K. Nemoga, Construction of S-boxes with high nonlinearity, Proc. of the conference 60-th Anniversary of the Faculty of Civil Engineering of STU Bratislava 1998, 217–222 (in Slovak).
J. Seberry, X.-M. Zhang and Y. Zheng, Systematic Generation of Cryptographically Robust S-boxes, Proceedings of the First ACM Conference on Computer and Communication Security Fairfax, USA, 1993.
M. Stanek and D. Olejár, Design of Substitution Blocks Satisfying Strict Avalanche Criterion 4th Workshop on Selected Areas in Cryptography–SAC '97, 1997, 2–12.
M. Stanek, On cryptographic strong Boolean functions PhDThesis, Bratislava, 2000 (in Slovak).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Šimovcová, M., Stanek, M. Generating cryptographically strong Boolean functions using partial information. Periodica Mathematica Hungarica 49, 119–130 (2004). https://doi.org/10.1023/B:MAHU.0000040543.22350.a0
Issue Date:
DOI: https://doi.org/10.1023/B:MAHU.0000040543.22350.a0