Differentially Uniform Mappings for Cryptography
Differentially Uniform Mappings for Cryptography
复制标题
DOI：
10.1007/3-540-48285-7_6
复制
发表时间：
1994-01
期刊：
影响因子：
--
通讯作者：
K. Nyberg
中科院分区：
文献类型：
--
作者：
K. Nyberg
这项工作的动机是观察到，在类des密码中，有可能以这样一种方式选择圆函数，即每个非平凡的单轮特征具有小概率。这就产生了以下定义。如果对于每个非零输入差和任何输出差，可能输入的数量有一个一致的上界，则称为差分均匀映射。本文所提供的差分一致映射的例子还具有其他理想的密码学性质：与仿射函数的大距离、高非线性阶数和高效的可计算性。
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.