Abstract
Cryptographic Boolean functions should have large distance to functions with simple algebraic description to avoid cryptanalytic attacks based on successive approximation of the round function such as the interpolation attack. Hyper-bent functions achieve the maximal minimum distance to all the coordinate functions of all bijective monomials. However, this class of functions exists only for functions with even number of inputs. In this paper we provide some constructions for Boolean functions with odd number of inputs that achieve large distance to all the coordinate functions of all bijective monomials.
Chapter PDF
Key words
References
R.E. Blahut, Theory and practice of error control codes, Addison-Wesley Publishing Company, 1983.
I. B. Damgard, On the randomness of Legendre and Jacobi sequences, Advances in Cryptology—CRYPTO’ 88, pp. 163–172.
J. F. Dillon, Elementary Hadamard difference sets, Ph.D. Dissertation, University of Maryland, 1974.
S.W. Golomb, Shift register sequences, Aegean Park Press, Laguna Hills, California, 1982.
C. Ding, T. Helleseth and W. Shan, On the linear complexity of Legendre sequences, IEEE Trans. Inf. Theory, vol. IT-44, no.3, pp. 1276–1278, May 1998.
P. Fan and M. Darnell, Sequence design for communications applications, John Wiley and Sons Inc., 1996.
C. Fontaine, The Nonlinearity of a class of Boolean functions with short representation, Proc. of Pragocrypt’ 96, pp. 129–144, 1996.
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. IT-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. No; H. Lee; H. Chung; H. Song, Trace representation of Legendre sequences of Mersenne prime period, IEEE Trans. Inf. Theory, vol. IT-42, no.6, pt.2, pp.2254–2255.
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.
N.J. Patterson, D.H. and Wiedemann, The covering radius of the (215, 16) Reed-Muller code is at least 16276, IEEE Trans. Inf. Theory, vol.IT-29, no.3, pp. 354–356, May 1983.
N.J. Patterson, D.H. and Wiedemann, Correction to: The covering radius of the (215, 16) Reed-Muller code is at least 16276, IEEE Trans. Inf. Theory, vol.IT-36, no.2, pp. 343, March 1990.
O.S. Rothaus, On bent functions, J. Combinatorial Theory, vol. 20(A), 1976, pp.300–305.
R.A. Scholtz and L.R. Welch, GMW sequences, IEEE Trans. Inf. Theory, vol.IT-30, no.3, pp. 548–553, May 1984.
A. Youssef and G. Gong, Hyper-bent functions, Advances in Cryptology, Proc. of Eurocrypt’2001, LNCS 2045, pp. 406–419, Springer-Verlag, 2001.
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., Gong, G. (2001). Boolean Functions with Large Distance to All Bijective Monomials: N Odd Case. In: Vaudenay, S., Youssef, A.M. (eds) Selected Areas in Cryptography. SAC 2001. Lecture Notes in Computer Science, vol 2259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45537-X_4
Download citation
DOI: https://doi.org/10.1007/3-540-45537-X_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43066-7
Online ISBN: 978-3-540-45537-0
eBook Packages: Springer Book Archive