Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On constructions and nonlinearity of correlation immune functions
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
Correlation Properties of the Bluetooth Combiner Generator
ICISC '99 Proceedings of the Second International Conference on Information Security and Cryptology
On Correlation-Immune Functions
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Cryptographically resilient functions
IEEE Transactions on Information Theory
A Brief Outline of Research on Correlation Immune Functions
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
New Results on Correlation Immunity
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On Resilient Boolean Functions with Maximal Possible Nonlinearity
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Autocorrelation Properties of Correlation Immune Boolean Functions
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Construction of Cryptographically Important Boolean Functions
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Evolving Boolean Functions Satisfying Multiple Criteria
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
On Relationships among Avalanche, Nonlinearity, and Correlation Immunity
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
New Constructions of Resilient Boolean Functions with Maximal Nonlinearity
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Minimum Distance between Bent and Resilient Boolean Functions
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
New cryptographic applications of boolean function equivalence classes
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions
Finite Fields and Their Applications
| Hi-index | 0.00 |
It has recently been shown that when m 1/2n - 1, the nonlinearity Nf of an mth-order correlation immune function f with n variables satisfies the condition of Nf ≤ 2n-1 - 2m, and that when m 1/2n - 2 and f is a balanced function, the nonlinearity satisfies Nf ≤ 2n-1 - 2m+1. In this work we prove that the general inequality, namely Nf ≤ 2n-1 - 2m, can be improved to Nf ≤ 2n-1 - 2m+1 for m ≥ 0.6n - 0.4, regardless of the balance of the function. We also show that correlation immune functions achieving the maximum nonlinearity for these functions have close relationships with plateaued functions. The latter have a number of cryptographically desirable properties.