Abstract
Siegenthaler proved that an n input 1 output, m-resilient (balanced mth order correlation immune) Boolean function with algebraic degree d satisfies the inequality: m + d ≤ n − 1. We provide a new construction method using a small set of recursive operations for a large class of highly nonlinear, resilient Boolean functions optimizing Siegenthaler’s inequality m + d = n − 1. Comparisons to previous constructions show that better nonlinearity can be obtained by our method. In particular, we show that as n increases, for almost all m, the nonlinearity obtained by our method is better than that provided by Seberry et al in Eurocrypt’93. For small values of n, the functions constructed by our method is better than or at least comparable to those constructed using the methods provided in papers by Filiol et al and Millan et al in Eurocrypt’98. Our technique can be used to construct functions on large number of input variables with simple hardware implementation.
Chapter PDF
References
P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation immune functions. In Advances in Cryptology-CRYPTO’91, pages 86–100. Springer-Verlag, 1992.
C. Carlet. More correlation immune and resilient functions over Galois fields and Galois rings. In Advances in Cryptology-EUROCRYPT’97, pages 422–433. Springer-Verlag, May 1997.
C. Carlet and P. Guillot. A characterization of bent functions. Journal of Combinatorial Theory, Series A, 76(2):328–335, September 1996.
C. Ding, G. Xiao, and W. Shan. The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science. Springer-Verlag, 1991.
E. Filiol and C. Fontaine. Highly nonlinear balanced Boolean functions with a good correlation-immunity. In Advances in Cryptology-EUROCRYPT’98. Springer-Verlag, 1998.
X. G. Zhen and J. Massey. A spectral characterization of correlation immune combining functions. IEEE Transactions on Information Theory, 34(3):569–571, May 1988.
R. W. Hamming. Coding And Information Theory. Prentice Hall Inc., 1980.
S. Maitra and P. Sarkar. Enumeration of correlation immune Boolean functions. In 4th Australasian Conference on Information, Security and Privacy. Springer Verlag, Lecture Notes in Computer Science, No 1587, 7–9 April 1999.
J. Massey. Shift-Register Synthesis and BCH Decoding. IEEE Transactions on Information Theory, IT-15:122–127, January 1969.
W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. In Advances in Cryptology-EUROCRYPT’89, pages 549–562. Springer-Verlag, 1990.
W. Millan, A. Clark, and E. Dawson. Heuristic design of cryptographically strong balanced Boolean functions. In Advances in Cryptology-EUROCRYPT’98. Springer-Verlag, 1998.
C. J. Mitchell. Enumerating Boolean functions of cryptographic significance. Journal of Cryptology, 2(3):155–170, 1990.
O. S. Rothaus. On bent functions. Journal of Combinatorial Theory, Series A20, pages 300–305, 1976.
R. A. Rueppel and O. J. Staffelbach. Products of Linear Recurring Sequences with Maximum Complexity. IEEE Transactions on Information Theory, IT-33:124–131, January 1987.
J. Seberry, X. M. Zhang, and Y. Zheng. Nonlinearly balanced Boolean functions and their propagation characteristics. In Advances in Cryptology-CRYPTO’93, pages 49–60. Springer-Verlag, 1994.
J. Seberry, X. M. Zhang, and Y. Zheng. On constructions and nonlinearity of correlation immune Boolean functions. In Advances in Cryptology-EUROCRYPT’93, pages 181–199. Springer-Verlag, 1994.
T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory, IT-30(5):776–780, September 1984.
T. Siegenthaler. Decrypting a class of stream ciphers using ciphertext only. IEEE Transactions on Computers, C-34(1):81–85, January 1985.
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
Maitra, S., Sarkar, P. (1999). Highly Nonlinear Resilient Functions Optimizing Siegenthaler’s Inequality. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive