Abstract
In the paper a method of efficient generation of random bent functions is presented. Obtaining a random bent function is not a straight forward process, since the introduction of bent functions in the most of published works studied their construction and gave algorithms for their generation. Drawing such functions at random from a set of all the Boolean functions is not feasible for n-argument functions for n higher than 4. On the other hand, all the known algorithms for constructing bent functions have deterministic dependencies which introduce certain low complexity problems and significantly narrow the range of bent functions that can be generated with each algorithm (bent function class). We describe a new method of obtaining random bent functions without constraints described above. The algorithm for generating bent functions operates in the Algebraic Normal Form domain. This approach allows for generation of bent functions of arbitrary order and even some special nonlinear requirements as homogeneity.
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
O’Connor L.J. An analysis of a class of algorithms for S-box construction. Journal of Cryptology, 7(3):133–152, 1994.
Shannon C.E. Communication Theory of Secrecy Systems. Bell Systems Technical Journal, 28:656–715, 1949.
Nyberg K. Perfect nonlinear S-boxes. Advances of Cryptology-EUROCRYPT’91, LNCS, 547:378–386, 1991.
Seberry J., Zhang X.M., Zheng Y. Systematic generation of cryptographically robust S-boxes. Proceedings of the 1st ACM Conference on Computer and Communication Security, 1993.
Rothaus OS. On bent functions. Journal of Combinatorial Theory, 20:300–305, 1976.
Preneel B, Van Leekwijck W, Van Linden L, Govaerts R, Vandewalle J. Propagation characteristics of Boolean functions. Advances in Cryptology — EUROCRYPT’90, LNCS, 473:161–173, 1991.
Dillon J.F. A Survey of Bent Functions, NSA Technical Journal, Special Issue, 191–215, 1972.
Adams C.M., Tavares S.E. Generating and Counting Binary Bent Sequences, IEEE Transactions on Information Theory, IT-36:1170–1173,1990.
Maiorana J. A. A Class of Bent Functions, R41 Technical Paper, 1971.
Adams CM. A Formal and Practical Design Procedure for Substitution Permutation Network Cryptosystems, Ph.D. Thesis, Department of Electrical Engineering, Queen’s University, 1990.
Dawson M, Tavares S. E. An Expanded Set of S-Box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks, Advances in Cryptology. Proc. of EUROCRYPT’91, 352–367, 1991.
Kam J.B., Davida G. Structured Design of Substitution-Permutation Encryption Networks, IEEE Transactions on Computers, C-28:747–753, 1979.
O’Connor L. An Analysis of Product Ciphers Based on the Properties of Boolean Functions, Ph.D. Thesis, Dept. of Computer Science, University of Waterloo, 1992.
Webster A.F., Tavares S.E. On the Design of S-Boxes, Advances in Cryptology: Proc. of CRYPTO’85, 523–534, 1986.
Forré R. The strict avalanche criterion: spectral properties of Boolean functions with high nonlinearity. Advances in Cryptology — CRYPTO’ 88, Springer-Verlag, 1990.
Meier W., Staffelbach A. Nonlinearity criteria for cryptographic functions. Advances in Cryptology — EUROCRYPT’89, LNCS, 434:549–562, 1990.
Biham E., Shamir A. Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, 1993.
Matsui M. Linear cryptanalysis method for DES cipher. Abstracts of EUROCRYPT’93, 1993.
Yarlagadda R., Hershey J.E. A note on the eigenvectors of Hadamard matrices of order 2n, Linear Algebra &Appl., 45:43–53, 1982.
Yarlagadda R., Hershey J.E. Analysis and synthesis of bent sequences, Proc. IEE, 136:112–123,1989.
Nyberg K. Constructions of bent functions and difference sets, Advances in Cryptology-EUROCRYPT’90, LNCS, 473, 1991.
Mister S., Adams C. Practical S-Box Design, Workshop on Selected Areas in Cryptography (SAC’ 96) Workshop Record, Queens University, pp. 61–76, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Grocholewska-Czurylo, A., Stoklosa, J. (2002). Generating Bent Functions. In: Sołdek, J., Pejaś, J. (eds) Advanced Computer Systems. The Springer International Series in Engineering and Computer Science, vol 664. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8530-9_29
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8530-9_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4635-7
Online ISBN: 978-1-4419-8530-9
eBook Packages: Springer Book Archive