Differentially Uniform Mappings for Cryptography

This work is motivated by the observation that in DES-like ciphexs 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-mro 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 ailbe functions, high nonlinear order and efficient computability.

• Type: Conference
• Year: 1993
• Where: EUROCRYPT
• Authors: Kaisa Nyberg
• Keywords: Cryptology, EUROCRYPT 1993, Non-mro Input Difference, Non-trivial One-round Characteristic, Uniform Upper Bound