Abstract
A good design of a Boolean function used in a stream cipher requires that the function satisfies certain criteria in order to resist different attacks. In this paper we study the tradeoff between two such criteria, the nonlinearity and the resiliency. The results are twofold. Firstly, we establish the maximum nonlinearity for a fixed resiliency in certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with good nonlinearity and some fixed resiliency.
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
P. Camion, C. Carlet, P. Charpin and N. Sendrier, “On Correlation-Immune functions”, Advances in Cryptology-CRYPTO’91, Lecture Notes in Computer Science, 1233, pp. 422–33, Springer-Verlag, 1997.
S. Chee, S. Lee, D. Lee, S.H. Sung, “On the correlation immune functions and their nonlinearity”, Advances in Cryptology-ASIACRYPT’ 96, Lecture Notes in Computer Science, 1163, pp. 232–243, Springer-Verlag, 1996.
L.E. Dickson (1900), Linear Groups with an Exposition of the Galois Field Theory, Teubner, Leipzig 1900; Dover, New York, 1958.
E. Filiol and C. Fontaine, “Highly Nonlinear Balanced Boolean Functions with a Good Correlation-Immunity” Advances in Cryptology-EUROCRYPT’98, Lecture Notes in Computer Science, 1403, pp. 475–488, Springer-Verlag, 1998.
R. Gallager, Information theory and reliable communication, 1968.
X.D. Hou, “On the Norm and Covering Radius of the First-Order Reed-Muller Codes”. IEEE Transactions on Information Theory, 43(3), pp.1025–1027, 1997.
B. Kolman and R.E. Beck, Elementary Linear Programming with Applications, Academic Press, 1995.
S. Maitra and P. Sarkar, “Highly Nonlinear Resilient Functions Optimizing Siegen-thaler’s Inequality” Advances in Cryptology-CRYPTO’99, Lecture Notes in Computer Science, 1666, pp. 198–215, Springer-Verlag, 1999.
W. Meier, and O. Staffelbach, “Fast correlation attacks on certain stream ciphers”, Advances in Cryptology-EUROCRYPT’88, Lecture Notes in Computer Science, 330, pp. 301–314, Springer-Verlag, 1988.
A. Menezes, P. van Oorschot, S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
W. Millan, A. Clark and E. Dawson, “Heuristic design of cryptographically strong balanced Boolean functions” Advances in Cryptology-EUROCRYPT’98, Lecture Notes in Computer Science, 1403, pp. 489–499, Springer-Verlag, 1998.
W. Millan, A. Clark and E. Dawson, “An effective genetic algorithm for finding highly nonlinear Boolean functions”, In First International Conference on Information and Communications Security, Lecture Notes in Computer Science, 1334, pp. 149–158, 1997.
T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”. IEEE Trans. Comput., vol. C-34, pp. 81–85, 1985.
T. Siegenthaler, “Correlation immunity of nonlinear combining functions for cryptographic applications”, IEEE Transactions on Information Theory, vol. IT-30, pp. 776–780, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pasalic, E., Johansson, T. (1999). Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_3
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive