Fast correlation attacks on stream ciphers
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Fast Correlation Attacks through Reconstruction of Linear Polynomials
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
Designs, Codes and Cryptography
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Maximal values of generalized algebraic immunity
Designs, Codes and Cryptography
Information Security and Cryptology --- ICISC 2008
Constructing symmetric boolean functions with maximum algebraic immunity
IEEE Transactions on Information Theory
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Constructions of cryptographically significant boolean functions using primitive polynomials
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On a conjecture about binary strings distribution
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Designs, Codes and Cryptography
A note on fast algebraic attacks and higher order nonlinearities
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Construction and analysis of boolean functions of 2t+1 variables with maximum algebraic immunity
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Boolean functions optimizing most of the cryptographic criteria
Discrete Applied Mathematics
On the algebraic immunity of symmetric boolean functions
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
IEEE Transactions on Information Theory
On the Construction of Boolean Functions With Optimal Algebraic Immunity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 0.04 |
It is a difficult challenge to construct Boolean functions with good cryptographic properties. In this paper, we construct an infinite class of even-variable balanced functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity (higher than all other known balanced functions with optimum algebraic immunity). For any balanced Boolean function with optimum algebraic immunity, it is still unknown what is the highest nonlinearity possible. We achieve a higher nonlinearity than previous methods which gives a new lower bound on the maximum possible nonlinearity of balanced Boolean functions with optimum algebraic immunity.