Abstract
Based on the hidden weighted bit function, we propose a family of cryptographically significant Boolean functions. We investigate its algebraic degree and use Schur polynomials to study its algebraic immunity. For a subclass of this family, we deduce a lower bound on its nonlinearity. Moreover, we give an infinite class of balanced functions with very good cryptographic properties: optimum algebraic degree, optimum algebraic immunity, high nonlinearity (higher than the Carlet-Feng function and the function proposed by [25]) and a good behavior against fast algebraic attacks. These functions seem to have the best cryptographic properties among all currently known functions.
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 subscriptionsReferences
Bryant, R.E.: On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. Comput. 40(2), 205–213 (1991)
Carlet, C.: Boolean Models and Methods in Mathematics, Computer Science, and Engineering. In: Boolean Functions for Cryptography and Error Correcting Codes. Cambridge University Press, pp. 257–397 (2010). http://www-roc.inria.fr/secret/Claude.Carlet/pubs.html
Carlet, C., Dalai, D.K., Gupta, K.C., Maitra, S.: Algebraic immunity for cryptographically significant Boolean functions: analysis and construction. IEEE Trans. Inf. Theory 52(7), 3105–3121 (2006)
Carlet, C., Feng, K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425–440. Springer, Heidelberg (2008)
Carlet, C., Zeng, X., Li, C., Hu, L.: Further properties of several classes of Boolean functions with optimum algebraic immunity. Des. Codes Cryptogr. 52, 303–338 (2009)
Courtois, N.T.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)
Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)
Cusick, T.W., Stǎnicǎ, P.: Cryptographic Boolean Functions and Applications. Elsevier-Academic Press, Stuanicua (2009)
Dalai, D.K., Gupta, K.C., Maitra, S.: Cryptographically significant Boolean functions: construction and analysis in terms of algebraic immunity. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 98–111. Springer, Heidelberg (2005)
Dalai, D.K., Maitra, S., Sarkar, S.: Baisc theory in construction of Boolean functions with maximum possible annihilator immunity. Des. Codes Crypt. 40(1), 41–58 (2006)
Feng, K., Liao, Q., Yang, J.: Maximum values of generalized algebraic immunity. Des. Codes Crypt. 50(2), 243–252 (2009)
Fu, S., Li, C., Qu, L.: Generalized construction of Boolean function with maximum algebraic immunity using univariate polynomial representation. IEICE Trans. E96.A(1), 360–362 (2013)
Hawkes, P., Rose, G.G.: Rewriting variables: the complexity of fast algebraic attacks on stream ciphers. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 390–406. Springer, Heidelberg (2004)
Knuth, D.E.: The Art of Computer Programming. Fascicle 1: Bitwise tricks & techniques; Binary Decision Diagrams, vol. 4. Addison-Wesley Professional, Massachusetts (2009)
Li, N., Qi, W.-F.: Construction and analysis of boolean functions of 2t+1 variables with maximum algebraic immunity. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 84–98. Springer, Heidelberg (2006)
Li, N., Qu, L., Qi, W., Feng, G., Li, C., Xie, D.: On the construction of boolean functions with optimal algebraic immunity. IEEE Trans. Inf. Theory 54(3), 1330–1334 (2008)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1986)
Liu, M., Zhang, Y., Lin, D.: Perfect algebraic immune functions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 172–189. Springer, Heidelberg (2012)
Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of boolean functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 474–491. Springer, Heidelberg (2004)
Pasalic, E.: Almost fully optimized infinite classes of boolean functions resistant to (fast) algebraic cryptanalysis. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 399–414. Springer, Heidelberg (2009)
Pasalic, E., Wei, Y.: On the construction of cryptographically significant boolean functions using objects in projective geometry spaces. IEEE Trans. Inf. Theory 58(10), 6681–6693 (2012)
Rizomiliotis, P.: On the resistance of boolean functions against algebraic attacks using univariate polynomial representation. IEEE Trans. Inf. Theory 56(8), 4014–4024 (2010)
Rothaus, O.S.: On bent functions. J. Comb. Theory - Ser. A 20(3), 300–305 (1976)
Tan, C., Goh, S.: Several classes of even-variable balanced boolean functions with optimal algebraic immunity. IEICE Trans. E94.A(1), 165–171 (2011)
Tang, D., Carlet, C., Tang, X.: Highly nonlinear boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks. IEEE Trans. Inf. Theory 59(1), 653–664 (2013)
Tu, Z., Deng, Y.: A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity. Des. Codes Crypt. 60(1), 1–14 (2011)
Wang, Q., Carlet, C., Stuanicua, P., Tan, C.H.: Cryptographic properties of the hidden weighted bit function. Discrete Appl. Math. 174, 1–10 (2014)
Wang, Q., Johansson, T.: A note on fast algebraic attacks and higher order nonlinearities. In: Lai, X., Yung, M., Lin, D. (eds.) Inscrypt 2010. LNCS, vol. 6584, pp. 404–414. Springer, Heidelberg (2011)
Wang, Q., Peng, J., Kan, H., Xue, X.: Constructions of cryptographically significant boolean functions using primitive polynomials. IEEE Trans. Inf. Theory 56(6), 3048–3053 (2010)
Wang, Q., Tan, C.H.: Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity. Discrete Appl. Math. 1673, 25–32 (2014)
Wang, Q., Tan, C.H.: A new method to construct boolean functions with good cryptographic properties. Inform. Process. Lett. 113(14), 567–571 (2013)
Wang, Q., Tan, C.H., Stuanicua, P.: Concatenations of the hidden weighted bit function and their cryptographic properties. Adv. Math. Commun. 8(2), 153–165 (2014)
Zeng, X., Carlet, C., Shan, J., Hu, L.: More balanced boolean functions with optimal algebraic immunity, and good nonlinearity and resistance to fast algebraic attacks. IEEE Trans. Inf. Theory 57(9), 6310–6320 (2011)
Acknowledgment
The first author would like to thank the financial support from the National Natural Science Foundation of China (Grant No. 61202463) and Shanghai Key Laboratory of Intelligent Information Processing, China (Grant No. IIPL-2011-005).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
The truth table of \({f}\) in Example 1:
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, Q., Tan, C.H., Foo, T. (2014). A Family of Cryptographically Significant Boolean Functions Based on the Hidden Weighted Bit Function. In: Lee, HS., Han, DG. (eds) Information Security and Cryptology -- ICISC 2013. ICISC 2013. Lecture Notes in Computer Science(), vol 8565. Springer, Cham. https://doi.org/10.1007/978-3-319-12160-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-12160-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12159-8
Online ISBN: 978-3-319-12160-4
eBook Packages: Computer ScienceComputer Science (R0)