Maximum correlation analysis of nonlinear s-boxes in stream ciphers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1880, Issue , 2000, Pages 501-514

  Zhang, Muxiang ^a   Chan, Agnes ^b  

^a VERIZON   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY; SPECTRUM ANALYZERS; WALSH TRANSFORMS;

INFORMATION LEAKAGE; LINEAR FEEDBACK SHIFT REGISTERS; LINEAR FUNCTIONS; MAXIMUM CORRELATION COEFFICIENT; MAXIMUM CORRELATIONS; SPECTRAL CHARACTERIZATION; STREAM CIPHERS; UPPER AND LOWER BOUNDS;

SHIFT REGISTERS;

EID: 84983158418     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_31     Document Type: Conference Paper

References (18)

1. C.M. Adams and S.E. Tavares. The structured design of cryptographically good S-boxes. Journal of Cryptology, vol. 3, pp. 27-41, 1990.
2. E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, vol. 4, no. 1, pp. 3-72, 1991.
3. F. Chabaud and S. Vaudenay. Links between differential and linear cryptanalysis. In Lectures in Computer Science, Advances in Cryptology-EUROCRYPT’94, vol. 950, pp. 356-365, Springer-Verlag, 1995.
4. J.H. Cheon, S. Chee, and C. Park. S-boxes with controllable nonlinearity. In Lecture Notes in Computer Science, Advances in Cryptology-EUROCRYPT’99, vol. 1592, pp. 286-294, Springer-Verlag, 1999.
5. T.M. Cover and J.A. Thomas. Elements of Information Theory. John Wiley & Sons Inc., 1991.
6. S.W. Golomb. Shift Register Sequences. Holden-Day, San Francisco, 1976. Reprinted by Aegean Park Press, 1982.
7. M.G. Karpovsky. Finite Orthogonal Series in the Design of Digital Devices. New York and Jerudalem: Wiley and TUP, 1976.
8. M. Matsui. Linear cryptanalysis method for DES ciphers. In Lecture Notes in Computer Science, Advances in Cryptology-EUROCRYPT’93, vol. 765, pp. 386-397, Springer-Verlag, 1994.
9. W. Meier and O. Staffelbach. Nonlinear criteria for cryptographic functions. In Lecture Notes of Computer Science, Advances in Cryptology: Proceedings of EUROCRYPT’ 89, vol. 434, pp. 549-562, Springer-Verlag, 1990.
10. K. Nyberg. Perfect nonlinear S-boxes. In Lecture Notes in Computer Science, Advance in Cryptology-EUROCRYPT’91, vol. 547, pp. 378-385, Springer-Verlag, 1991.
11. K. Nyberg. On the construction of highly nonlinear permutations. In Lecture Notes in Computer Science, Advance in Cryptology-EUROCRYPT’92, vol. 658, pp. 92-98, Springer-Verlag, 1993.
12. B. Preneel, W.V. Leekwijck, L.V. Linden, R. Govaerts, and J. Vandewalle. Propagation characteristics of Boolean functions. In Lecture Notes in Computer Science, Advance in Cryptology-EUROCRYPT’90, vol. 473, pp. 161-173, Springer-Verlag, 1991.
13. O. S. Rothaus. On bent functions. J. Combinatorial Theory, Series A, vol. 20, pp. 300-305, 1976.
14. R. Rueppel. Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin, 1986.
15. R. A. Rueppel. Streamciphers. In Contemporary Cryptology: The Science of Information Integrity, G. Simmons ed., New York: IEEE Press, pp. 65-134, 1991.
16. J. Seberry, X.M. Zhang, and Y. Zheng. Systematic generation of cryptographically robust S-boxes. In Proceedings of the first ACM Conference on Computer and Communications Security, pp. 172-182, 1993.
17. T. Siegenthaler. Decrypting a class of streamciphers using ciphertext only. IEEE Trans. Computer, vol. C-34, no. 1, pp. 81-85, 1985.
18. Guozhen Xiao and J. L. Massey. A spectral characterization of correlation-immune combining functions. IEEE Trans. on Information Theory, vol. IT-34, no. 3, pp. 564-571, 1988.