This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators. Such combination generators have higher throughput than those using Boolean functions as the combining functions. However, S-boxes tend to leak more information about the LFSR sequences than Boolean functions. To study the information leakage, the notion of maximum correlation is introduced, which is based on the correlation between linear functions of the input and all the Boolean functions (linear and nonlinear) of the output of an S-box. Using Walsh transform, a spectral characterization of the maximum correlation coefficients, together with their upper and lower bounds, are established. For the perfect nonlinear S-boxes designed for block ciphers, an upper bound on the maximum correlation coefficients is presented.
CITATION STYLE
Zhang, M., & Chan, A. (2000). Maximum correlation analysis of nonlinear s-boxes in stream ciphers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1880, pp. 501–514). Springer Verlag. https://doi.org/10.1007/3-540-44598-6_31
Mendeley helps you to discover research relevant for your work.