Introduces generalized additive autocorrelation to characterize DLCT of vectorial Boolean functions, derives DLU bounds, studies special classes, proves EA invariance of DLU but not CCZ, and computes spectra for 4-bit optimal S-boxes and selected polynomials.
Budaghyan, Construction and analysis of cryptograph ic functions, New York, NY, USA: Springer- V erlag, 2014
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Differential Linear Connectivity Table of Vectorial Boolean Functions
Introduces generalized additive autocorrelation to characterize DLCT of vectorial Boolean functions, derives DLU bounds, studies special classes, proves EA invariance of DLU but not CCZ, and computes spectra for 4-bit optimal S-boxes and selected polynomials.