Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
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
Constructions of cryptographically significant boolean functions using primitive polynomials
IEEE Transactions on Information Theory
Equivalence classes of Boolean functions for first-order correlation
IEEE Transactions on Information Theory
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
IEEE Transactions on Information Theory
Constructions of 1-resilient Boolean functions on odd number of variables with a high nonlinearity
Security and Communication Networks
Hi-index | 0.00 |
This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almost optimal nonlinearity. Apart from their high nonlinearity, the functions reach Siegenthaler's upper bound of algebraic degree. Also a class of 1-resilient functions on any number n 2 of variables with at least sub-optimal algebraic immunity is provided.