Abstract
A general explicit construction of bent functions is described, which unifies well known constructions due to Maiorana-McFarland and Dillon as two opposite extremal cases. Within this framework we also find new ways to generate bent functions. Then it is shown how the constructed bent functions can be modified in order to obtain highly nonlinear balanced Boolean functions. Although their nonlinearity is the best known so far, it remains open whether this bound can still be improved.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Blackburn, S.: private communication, 1995.
Carlet, C: Two new classes of bent functions. Advances in Cryptology, Eurocrypt '93, Lecture Notes in Computer Science 765, Springer-Verlag 1994, pp. 77–101.
Carlet, C: Generalized partial spreads. IEEE Transactions on Information Theory (to appear).
Dillon, J.F.: Elementary Hadamard difference sets. Proceedings of the Sixth South-eastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, Congressus Numerantium No. XIV, Utilitas Math., Winnipeg, Manitoba, 1975, pp. 237–249.
Matsui, M.: Linear cryptanalysis method for DES cipher. Advances in Cryptology, Eurocrypt '93, Lecture Notes in Computer Science 765, Springer-Verlag 1994, pp. 386–397.
McFarland, R. L.: A family difference sets in non-cyclic groups. J. Combinatorical Theory, Ser. A, 15 (1973), pp. 1–10.
Patterson, N.J., Wiedemann, D.H.: The covering radius of the (215,16) Reed-Muller code is at least 16276. IEEE Transactions on Information Theory 29 (1983), pp. 354–356.
Rothaus, O.S.: On “bent” functions. J. Combinatorical Theory, Ser. A, 20 (1976), pp. 300–305.
Seberry, J., Zhang, X., Zheng, Y.: Nonlinearity and propagation characteristics of balanced Boolean functions. Information & Computation (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dobbertin, H. (1995). Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Preneel, B. (eds) Fast Software Encryption. FSE 1994. Lecture Notes in Computer Science, vol 1008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60590-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-60590-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60590-4
Online ISBN: 978-3-540-47809-6
eBook Packages: Springer Book Archive