Abstract
The minimum distance between bent and resilient functions is studied. This problem is converted into two problems. One is to construct a special matrix, which leads to a combinatorial problem; the other is the existence of bent functions with specified types. Then the relation of these two problems is studied. For the 1-resilient functions, we get a solution to the first combinatorial problem. By using this solution and the relation of the two problems, we present a formula on the lower bound of the minimum distance of bent and 1-resilient functions. For the latter problem, we point out the limitation of the usage of the Maiorana-McFarland type bent functions, and the necessity to study the existence of bent functions with special property which we call partial symmetric. At last, we give some results on the nonexistence of some partial symmetric bent functions.
This work is supported by the Natural Science Foundation of China(NO.60573028, 60803156) and the open research fund of National Mobile Communications Research Laboratory of Southeast University(W200807).
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
Chor, B., Goldreich, O., et al.: Extraction problem or t-resilient functions. In: 26th IEEE Symp. Foundations of Computer Science, vol. 26, pp. 396–407 (1985)
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. PhD 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 functions. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 143–160. Springer, Heidelberg (2004)
Maity, S., Arackaparambil, C., Meyase, K.: Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. In: Gong, G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp. 417–431. Springer, Heidelberg (2006)
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)
Tarannikov, Y.V.: On resilient Boolean functions with maximum possible nonlinearity. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 19–30. Springer, Heidelberg (2000)
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)
Zheng, Y., Zhang, X.M.: Improved upper bound on the nonlinearity of high order correlation immune functions. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 264–274. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qu, L., Li, C. (2009). Minimum Distance between Bent and Resilient Boolean Functions. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-01877-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01813-8
Online ISBN: 978-3-642-01877-0
eBook Packages: Computer ScienceComputer Science (R0)