Differentially uniform mappings for cryptography

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

Volumn 765 LNCS, Issue , 1994, Pages 55-64

  Nyberg, Kaisa ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING;

CRYPTOGRAPHIC PROPERTIES; HIGH NONLINEAR; NON-TRIVIAL; ROUND FUNCTIONS; UPPER BOUND;

CRYPTOGRAPHY;

EID: 84962968104     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48285-7_6     Document Type: Conference Paper

References (7)

1. E. Biham, A. Shamir, Differential Cryptanalysis of DES-like Cryptosystems, J. Cryptology 4 (1991).
2. C. Carlet, Codes de Reed-Muller, codes de Kerdock et de Preparata, thesis, Publication of LITP, Institut Blaise Pascal, Univereité Paris 6, 90.59 (1990).
3. L. Carlitz and S. Uchiyama, Bounds for exponential sums, Duke Math. J. 24 (1957), 37–41.
4. X. Lai, J. L. Massey and S. Murphy, Markov Ciphers and Differential Cryptanalysis, Advances in Cryptology-Eurocrypt’ 91. Lecture Notes in Computer Science 547, Springer-Verlag (1992).
5. T. Matsumoto and H. Imai, Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. Advances in Cryptology-Eurocrypt’ 88. Lecture Notes in Computer Science 330, Springer-Verlag (1988).
6. K. Nyberg, On the construction of highly nonlinear permutations, Advances in Cryptology-Eurocrypt’ 92. Lecture Notes in Computer Science 658, Springer-Verlag (1993).
7. K. Nyberg and L. R. Knudsen, Provable Security Against Differential Cryptanalysis, Proceedings of Crypto’ 92 (to appear).