Abstract
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine monomials. In this paper we introduce a new class of bent functions which we call hyper-bent functions. Functions within this class achieve the maximal minimum distance to all the coordinate functions of all bijective monomials. We provide an explicit construction for such functions. We also extend our results to vectorial hyper-bent functions.
Chapter PDF
Similar content being viewed by others
References
R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley Publishing Company, 1983.
C. Carlet, A construction of bent functions, Proc. of Third Conference of Finite Fields and Applications, Glasgow, London Mathematical Society, Lecture Series 233, Cambridge University Press, 1996, pp. 47–58.
C. Carlet, Two new classes of bent functions, Advances in Cryptology-EuroCrypt'85, Lecture Notes in Computer Science, No. 765, Springer-Verlag, 1994, pp. 77–101.
C. Carlet, P. Charpin and V. Zinoviev, Codes, bent functions and permutations suitable for DES-like cryptosystems, Designs, Codes and Cryptography. vol.15, no.2; Nov. 1998; pp.125–156.
C. Carlet, Hyper-bent functions, PRAGOCRYPT'96, Czech Technical University Publishing House, Prague, pp. 145–155, 1996.
J. F. Dillon, Elementary Hadamard Difference sets, Ph.D. Dissertation, University of Maryland, 1974.
J. F. Dillon, Elementary Hadamard Difference sets, in Proc. Sixth S-E Conf. Comb. Graph Theory and Comp., 237–249, F. Hoffman et al. (Eds), Winnipeg Utilitas Math (1975).
H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, Proceedings of Fast Software Encryption, Second International Workshop, Springer-Verlag, 1995, pp. 61–74.
S.W. Golomb, Shift Register Sequences, Aegean Park Press. Laguna Hills, California. 1982.
G. Gong, Theory and applications of q-ary interleaved sequences, IEEE Trans. on Inform. Theory, vol. 41, No. 2, 1995, pp. 400–411.
G. Gong and S. W. Golomb, Transform Domain Analysis of DES, IEEE transactions on Information Theory. Vol. 45. no. 6. pp. 2065–2073. September, 1999.
T. Jakobsen and L. Knudsen, The Interpolation Attack on Block Ciphers, LNCS 1267, Fast Software Encryption. pp. 28–40. 1997.
T. Jakobsen, Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree, Proceedings of Crypto'99. LNCS 1462. pp. 213–222. 1999.
J. Daemen and V. Rijmen, AES Proposal: Rijndael, http://csrc.nist.gov/encryption/aes/rijndael/
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, Volume 20, Addison-Wesley, 1983.
M. Matsui, Linear Cryptanalysis method for DES cipher Advances in Cryptology, Proceedings of Eurocrypt'93, LNCS 765, pp. 386–397, Springer-Verlag, 1994.
R. J. McEliece, Finite Fields For Computer Scientists and Engineers, Kluwer Academic Publishers, Dordrecht, 1987.
R.L. McFarland, A family of Noncyclic Difference Sets, Journal of Comb. Th. (Series A) 15, pp. 1–10, 1973.
W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, Proceedings of EUROCRYPT '89, Springer-Verlag, Berlin, Germany, 1990 pp. 549–62.
K. Nyberg, S-boxes and round functions with controllable linearity and differential uniformity, Proceedings of Fast Software Encryption, Second International Workshop, Springer-Verlag, Berlin, Germany, 1995, pp.111–130.
K. Nyberg, Perfect nonlinear S-boxes, Proceedings of EUROCRYPT '91, Springer-Verlag, Berlin, Germany, 1991, pp.378–86.
P. Sarkar and S. Maitra, Nonlinearity Bounds and Constructions of Resilient Boolean Functions, Proceedings of CRYPTO '2000, Springer-Verlag, Berlin, Germany, LNCS 1880, pp. 515–532.
O.S. Rothaus, On bent functions, J. Combinatorial Theory, vol. 20(A), 1976, pp.300–305.
T. Satoh, T. Iwata and K. Kurosawa, On cryptographically secure vectorial Boolean functions, Proceedings of ASIACRYPT'99, Springer-Verlag, Berlin, Germany, 1999, pp. 20–28.
T. Iwata and K. Kurosawa, Probabilistic higher order differential cryptanalysis and higher order bent functions. Proceedings of ASIACRYPT'99, Springer-Verlag, Berlin, Germany, 1999, pp. 62–74.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Youssef, A.M., Gong, G. (2001). Hyper-bent Functions. In: Pfitzmann, B. (eds) Advances in Cryptology — EUROCRYPT 2001. EUROCRYPT 2001. Lecture Notes in Computer Science, vol 2045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44987-6_25
Download citation
DOI: https://doi.org/10.1007/3-540-44987-6_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42070-5
Online ISBN: 978-3-540-44987-4
eBook Packages: Springer Book Archive