Construction of high degree resilient S-boxes with improved nonlinearity

Authors:
Kishan Chand Gupta;Palash Sarkar
Affiliations:
Cryptology Research Centre, Applied Statistics Unit, Indian Statistical Institute, 203, B.T. Road, Kolkata 700 108, India;Cryptology Research Centre, Applied Statistics Unit, Indian Statistical Institute, 203, B.T. Road, Kolkata 700 108, India
Venue:
Information Processing Letters
Year:
2005

Citing 7
Cited 2

Privacy amplification by public discussion

SIAM Journal on Computing - Special issue on cryptography
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
Almost perfect nonlinear power functions on GF(2n): the Welch case

IEEE Transactions on Information Theory
Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)

IEEE Transactions on Information Theory
A spectral characterization of correlation-immune combining functions

IEEE Transactions on Information Theory
Improved construction of nonlinear resilient S-boxes

IEEE Transactions on Information Theory

The design of cryptographic S-boxes using CSPs

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Construction of highly nonlinear resilient S-boxes with given degree

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a simple method to use an [n-d-1,m,t+1] code to construct an n-input, m-output, t-resilient function with degree dm and nonlinearity 2^n^-^1-2^n^-^@?^(^d^+^1^)^/^2^@?-(m+1)2^n^-^d^-^1. For any fixed values of parameters n,m,t and d, with dm, the nonlinearity obtained by our construction is higher than the nonlinearity obtained by Cheon in Crypto 2001.