Generalization of siegenthaler inequality and schnorr-vaudenay multipermutations

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

Volumn 1109, Issue , 1996, Pages 372-386

  Camion, Paul ^a   Canteaut, Anne ^a  

^a INRIA   (France)

Author keywords

Correlation immune functions; Cryptanalysis; Hash functions; Orthogonal arrays; Stream ciphers

Indexed keywords

BOOLEAN FUNCTIONS; HASH FUNCTIONS; SHIFT REGISTERS;

BINARY COMPONENTS; CORRELATION IMMUNE FUNCTIONS; CORRELATION IMMUNITY; CRYPTANALYSIS; CRYPTOGRAPHIC PRIMITIVES; LINEAR FEEDBACK SHIFT REGISTERS; ORTHOGONAL ARRAY; STREAM CIPHERS;

ORTHOGONAL FUNCTIONS;

EID: 1942512572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_28     Document Type: Conference Paper

References (12)

1. L. Brynielsson. On the linear complexity of combined shift register sequences. In F. Pichler, editor, Advances in Cryptology - EUROCRYPT '85, number 219 in Lecture Notes in Computer Science, pages 156-160. Springer-Verlag, 1986.
2. K.A. Bush. Orthogonal arrays of index unity. Ann. Math. Stat., 23:426-434, 1952.
3. P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation-immune functions. In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO'91, number 576 in Lecture Notes in Computer Science, pages 86-100. Springer-Verlag, 1992.
4. K. Gopalakrishnan and D.R. Stinson. Three characterizations of non-binary correlation-immune and resilient functions. Designs, Codes and Cryptography, 5:241-251, 1995.
5. T. Herlestam. On functions of linear shift register sequences. In F. Pichler, editor, Advances in Cryptology - EUROCRYPT '85, number 219 in Lecture Notes in Computer Science, pages 119-129. Springer-Verlag, 1986.
6. U.M. Maurer and J.L. Massey. Perfect local randomness in pseudo-random sequences. In G. Brassard, editor, Advances in Cryptology - CRYPTO'89, number 435 in Lecture Notes in Computer Science, pages 100-112. Springer-Verlag, 1990.
7. C.R. Rao. Factorial experiments derivable from combinatorial arrangements of arrays. J. Roy. Statist., 9:128-139, 1947.
8. R.A. Rueppel. Analysis and Design of stream ciphers. Springer-Verlag, 1986.
9. R.A. Rueppel and O.J. Staífelbach. Products of linear recurring sequences with maximum complexity. IEEE Trans. Inform. Theory, IT-33(1):124-131, 1987.
10. C.-P. Schnorr and S. Vaudenay. Black box cryptanalysis of hash networks based on multipermutations. In A. De Santis, editor, Advances in Cryptology - EU- ROCRYPT'94, number 950 in Lecture Notes in Computer Science, pages 47-57. Springer-Verlag, 1995.
11. C.P. Schnorr and S. Vaudenay. Parallel FFT-Hashing. In Fast Software Encryption, number 809 in Lecture Notes in Computer Science, pages 149-156. Springer- Verlag, 1994.
12. T. Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. Inform. Theory, IT-30(5):776-780, 1984.