zbMATH — the first resource for mathematics

Differentially uniform mappings for cryptography. (English) Zbl 0951.94510
Helleseth, Tor (ed.), Advances in cryptology - EUROCRYPT ’93. Workshop on the theory and application of cryptographic techniques, Lofthus, Norway, May 23-27, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 765, 55-64 (1994).
Summary: 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 also have other desirable cryptographic properties: large distance from affine functions, high nonlinear order and efficient computability.
For the entire collection see [Zbl 0847.00050].

94A60 Cryptography