Abstract
In this paper we present a strategy to construct 1-resilient Boolean functions with very good nonlinearity and autocorrelation. Our strategy to construct a 1-resilient function is based on modifying a bent function, by toggling some of its output bits. Two natural questions that arise in this context are “at least how many bits and which bits in the output of a bent function need to be changed to construct a 1-resilient Boolean function”. We present an algorithm which determines a minimum number of bits of a bent function that need to be changed to construct a 1-resilient Boolean function. We also present a technique to compute points whose output in the bent function need to be modified to get a 1-resilient function. In particular, the technique is applied upto 14-variable functions and we show that the construction provides 1-resilient functions reaching currently best known nonlinearity and achieving very low autocorrelation absolute indicator values which were not known earlier.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Charpin, P., Pasalic, E.: On propagation characteristics of resilient functions. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 175–195. Springer, Heidelberg (2003)
Dillon, J.F.: Elementary Hadamard Difference sets. Ph.D. Thesis, University of Maryland (1974)
Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 61–74. Springer, Heidelberg (1995)
Guo-Zhen, X., Massey, J.: A spectral characterization of correlation immune combining functions. IEEE Transactions on Information Theory 34(3), 569–571 (1988)
Maity, S., Johansson, T.: Construction of Cryptographically important Boolean functions. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 234–245. Springer, Heidelberg (2002)
Maity, S., Maitra, S.: Minimum distance between bent and 1-resilient boolean functions. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 143–160. Springer, Heidelberg (2004)
Rothaus, O.S.: On bent functions. Journal of Combinatorial Theory, Series A 20, 300–305 (1976)
Sarkar, P., Maitra, S.: Nonlinearity bounds and constructions of resilient Boolean functions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 515–532. Springer, Heidelberg (2000)
Seberry, J., Zhang, X.-M., Zheng, Y.: Nonlinearly balanced boolean functions and their propagation characteristics. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 49–60. Springer, Heidelberg (1994)
Tarannikov, Y.V.: New constructions of resilient Boolean functions with maximal nonlinearity. In: Matsui, M. (ed.) FSE 2001. LNCS, vol. 2355, pp. 66–77. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maity, S., Arackaparambil, C., Meyase, K. (2006). Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_36
Download citation
DOI: https://doi.org/10.1007/11863854_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44523-4
Online ISBN: 978-3-540-44524-1
eBook Packages: Computer ScienceComputer Science (R0)