Abstract
Based on the work of Rothaus [12], Olsen, Scholtz and Welch suggested the bent functions to be used as feed-forward functions to generate binary sequences which possess high linear complexity and very nearly optimum crosscorrelation properties [10]. In [7] Meier and Staffelbach discovered, that binary bent functions give a solution to the correlation problem when used as combining functions of several binary linear shiftregister sequences. One of their results is that bent functions are at maximum distance to the set of affine functions. We refer to [7] for the cryptographic background and motivation. The general theory of the bent functions from Z n q to Z q was developed by Kumar, Scholtz and Welch [2].
Chapter PDF
Similar content being viewed by others
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.
References
J. F. Dillon, Elementary Hadamard difference sets, Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida (1975), 237–249; Congressus Numerantium No. XIV, Utilitas Math., Winnipeg, Manitoba (1975).
P. V. Kumar, R. A. Scholtz and L. R. Welch, Generalized bent functions and their properties, J. Combinatorial Theory, Ser. A 40 (1985), 90–107.
A. Lempel and M. Cohn, Maximal families of bent sequences, IEEE Trans. Inform. Theory IT-28 (1982), 865–868.
R. Lidl and H. Niederreiter, “Introduction to finite fields and their applications,” Cambridge University Press, Cambridge, 1986.
H. B. Mann, “Addition theorems,” John Wiley & Sons, New York, 1965.
R. L. McFarland, A family of difference sets in non-cyclic groups, J. Combinatorial Theory, Ser. A 15 (1973), 1–10.
W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, Advances in Cryptology, Proceedings of Eurocrypt’ 89 (to appear).
P. K. Menon, Difference sets in Abelian groups, Proc. Amer. Math. Soc. 11 (1960), 368–376.
_____, On difference sets whose parameters satisfy a certain relation, Proc. Amer. Math. Soc. 13 (1962), 739–745.
J. D. Olsen, R. A. Scholtz and L. R. Welch, Bent function sequences, IEEE Trans. Inform. Theory IT-28 (1982), 858–864.
B. Preneel et al., Propagation characteristics of Boolean bent functions, Proceedings of Eurocrypt’ 90 (to appear).
O. S. Rothaus, On “bent” functions, J. Combinatorial Theory, Ser. A 20 (1976), 300–305.
R. J. Turyn, Character sums and difference sets, Pacific J. Math. 15 (1965), 319–346.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyberg, K. (1991). Constructions of bent functions and difference sets. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive