Regular PapersNo Access

NEW CONSTRUCTIONS OF VECTORIAL BOOLEAN FUNCTIONS WITH GOOD CRYPTOGRAPHIC PROPERTIES

DESHUAI DONG

College of Science, National University of Defense Technology, Changsha, 410073, P. R. China

Search for more papers by this author

LONGJIANG QU

College of Science, National University of Defense Technology, Changsha, 410073, P. R. China

Search for more papers by this author

SHAOJING FU

School of Computer Science, National University of Defense Technology, Changsha, 410073, P. R. China

Search for more papers by this author

, and

CHAO LI

College of Science, National University of Defense Technology, Changsha, 410073, P. R. China

Search for more papers by this author

https://doi.org/10.1142/S0129054112500086Cited by:2 (Source: Crossref)

Abstract

Vectorial Boolean functions play an important role in cryptography. How to construct vectorial Boolean functions with good cryptographic properties is a nice problem that worth to be investigated. In this paper we present several constructions of balanced vectorial Boolean functions with high algebraic immunity, high(or optimum) algebraic degree, and very high nonlinearity. In some cases, the constructed functions also achieve optimum algebraic immunity.

Keywords:

References

F. Armknecht and M. Krause, Constructing Single- and Multi-Output Boolean Functions with Maximal Algebraic Immunity, ICALP 2006, LNCS 4052 (Springer-Verlag, 2006) pp. 180–191. Google Scholar
C. Carlet and K. Feng, An infinite class of balanced vectorial Boolean functions with optimum algebraic immunity and good nonlinearity, IWCC 2009, LNCS 5557 (Springer-Verlag, 2009) pp. 1–11. Google Scholar
N. Courtois and W. Meier, Algebraic attacks on Stream Ciphers with Linear Feedback, Proceedings of Eurocrypt 2003, LNCS 2656 (Springer-Verlag, 2003) pp. 345–359. Google Scholar
J. F. Dillon, Elementary Hadamard difference sets. Ph.D. Thesis, Univ. of Maryland, 1974 . Google Scholar
H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity, Workshop on Fast Software Encryption (Lecture Notes in Computer Science), LNCS 1008 (Springer-Verlag, 1995) pp. 61–74. Google Scholar
K. Feng and J. Yang, International Journal of Foundations of Computer Science 22, 1271 (2011). Link, Web of Science, Google Scholar
K. Feng, Q. Liao and J. Yang, Designs, Codes Cryptogr. 50, 243 (2009). Crossref, Web of Science, Google Scholar
V. Lint , Introduction to coding theory , 3rd edn. , GTM 86 ( Springer , 1999 ) . Crossref, Google Scholar
W. Meier, E. Pasalic and C. Carlet, Algebraic attacks and decomposition of Boolean functions, Advances in Cryptology - EUROCRYPT 2004, LNCS 3027 (Springer-Verlag, 2004) pp. 474–491. Google Scholar
X. Tang, D. Tang, X. Zeng, L. Hu, Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity. Available at , http://eprint.iacr.org/2010/443.pdf . Google Scholar
Z. Tu and Y. Deng, Designs, Codes Cryptogr. 60, 1 (2011), http://eprint.iacr.org/2009/272. Crossref, Web of Science, Google Scholar
F. Chabaud and S. Vaudenay, Links between differential and linear crytanalysis, Advances in Cryptology - EUROCRYPT 1994, LNCS 950 (Springer-Verlag, 1994) pp. 356–365. Google Scholar