Abstract
This work is motivated by the observation that in DES-like ciphers it is possible to choose the round functions in such a way that every non-trivial one-round characteristic has small probability. This gives rise to the following definition. A mapping is called differentially uniform if for every non-zero input difference and any output difference the number of possible inputs has a uniform upper bound. The examples of differentially uniform mappings provided in this paper have also other desirable cryptographic properties: large distance from affine functions, high nonlinear order and efficient computability.
The work of the author on this project is supported by the MATINE Board, Finland
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Biham, A. Shamir, Differential Cryptanalysis of DES-like Cryptosystems, J. Cryptology 4 (1991).
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).
L. Carlitz and S. Uchiyama, Bounds for exponential sums, Duke Math. J. 24 (1957), 37–41.
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).
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).
K. Nyberg, On the construction of highly nonlinear permutations, Advances in Cryptology-Eurocrypt’ 92. Lecture Notes in Computer Science 658, Springer-Verlag (1993).
K. Nyberg and L. R. Knudsen, Provable Security Against Differential Cryptanalysis, Proceedings of Crypto’ 92 (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyberg, K. (1994). Differentially uniform mappings for cryptography. In: Helleseth, T. (eds) Advances in Cryptology — EUROCRYPT ’93. EUROCRYPT 1993. Lecture Notes in Computer Science, vol 765. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48285-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-48285-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57600-6
Online ISBN: 978-3-540-48285-7
eBook Packages: Springer Book Archive