Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
On constructions and nonlinearity of correlation immune functions
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Finite fields
Two results on the bit extraction problem
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Elliptic Curves and Resilient Functions
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
On Correlation-Immune Functions
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Bounds for Resilient Functions and Orthogonal Arrays
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On the Correlation Immune Functions and Their Nonlinearity
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions
Proceedings of the 7th IMA International Conference on Cryptography and Coding
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
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
Improved Construction of Nonlinear Resilient S-Boxes
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Characterisations of extended resiliency and extended immunity of s-boxes
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Construction of highly nonlinear resilient S-boxes with given degree
Designs, Codes and Cryptography
| Hi-index | 0.00 |
An (n, m, k)-resilient function is a function f : Fn2 → Fm2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed by an adversary and the remaining n - k input bits are chosen independently at random. In this paper we propose a new method to generate a (n + D + 1, m, d - 1)- resilient function for any non-negative integer D whenever a [n, m, d] linear code exists. This function has algebraic degree D and nonlinearity at least 2n+D - 2n⌊√2n+D+1⌋ + 2n-1. If we apply this method to the simplex code, we can get a (t(2m - 1) + D + 1, m, t2m-1 - 1)-resilient function with algebraic degree D for any positive integers m, t and D. Note that if we increase the input size by D in the proposed construction, we can get a resilient function with the same parameter except algebraic degree increased by D.