Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Fundamentals of Computer Security
Fundamentals of Computer Security
Nonlinear Vector Resilient Functions
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers
CRYPTO '85 Advances in Cryptology
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Designs, Codes and Cryptography
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Construction of high degree resilient S-boxes with improved nonlinearity
Information Processing Letters
Linear structures in blockciphers
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
New constructions for resilient and highly nonlinear boolean functions
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Cryptographically resilient functions
IEEE Transactions on Information Theory
Linear codes in generalized construction of resilient functions with very high nonlinearity
IEEE Transactions on Information Theory
A construction of resilient functions with high nonlinearity
IEEE Transactions on Information Theory
Improved construction of nonlinear resilient S-boxes
IEEE Transactions on Information Theory
Maiorana–McFarland Class: Degree Optimization and Algebraic Properties
IEEE Transactions on Information Theory
A recursive construction of highly nonlinear resilient vectorial functions
Information Sciences: an International Journal
Hi-index | 0.00 |
We provide two new construction methods for nonlinear resilient S-boxes with given degree. The first method is based on the use of linear error correcting codes together with highly nonlinear S-boxes. Given a [u, m, t + 1] linear code where u = n驴d驴1, d m, we show that it is possible to construct (n, m, t, d) resilient S-boxes which have currently best known nonlinearity. Our second construction provides highly nonlinear (n, m, t, d) resilient S-boxes which do not have linear structure, then an improved version of this construction is given.