Constructions of bent functions and difference sets
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Journal of Complexity - Special issue on coding and cryptography
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
Designs, Codes and Cryptography
Further properties of several classes of Boolean functions with optimum algebraic immunity
Designs, Codes and Cryptography
Period-different m-sequences with at most four-valued cross correlation
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
Partially perfect nonlinear functions and a construction of cryptographic boolean functions
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
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
New pairs of m-sequences with 4-level cross-correlation
Finite Fields and Their Applications
Hi-index | 0.00 |
In this paper, we propose an infinite class of Boolean functions with four-valued Walsh spectra. These functions have a simple trace expression of the form f(x) = tr1n(xd(2n+1))+ tr12n(bx) for b ∈ F22n and d satisfying d(2l+1) = 2i(mod 2n-1) with integers l and i, where x ∈ F22n. Their cryptographic properties, including balancedness, spectrum distribution, nonlinearity, algebraic degree and algebraic immunity, are investigated. We prove that the proposed functions have high nonlinearity, and algebraic degrees n - gcd(n, l) + 2. Our computer simulation shows these functions have optimal or suboptimal algebraic immunity.