Toward a general correlation theorem

Toward a general correlation theorem
复制标题

DOI:
10.1109/tit.2005.853326
复制
发表时间:
2005-09
影响因子:
2.5
通讯作者:
K. Gupta;P. Sarkar
K. Gupta;P. Sarkar
中科院分区:
计算机科学2区
文献类型:
--
作者:
K. Gupta;P. Sarkar

文献摘要

被引文献

相似文献

2001年,Nyberg证明了三个重要的相关定理,并将它们应用到几个密码分析环境中。我们在更理论化的方向上继续Nyberg的工作。我们考虑了一个一般的函数形式,并得到了它的Walsh变换。尼伯格的两个相关定理被看作是一般泛函形式的特例。S-box查找、加法模2/sup 2k/和X-OR是对称密码设计中经常出现的三个操作。我们考虑了两种组合这些操作的方法,并在每种方法中应用我们的主要结果来获得Walsh变换。
In 2001, Nyberg proved three important correlation theorems and applied them to several cryptanalytic contexts. We continue the work of Nyberg in a more theoretical direction. We consider a general functional form and obtain its Walsh transform. Two of Nyberg's correlation theorems are seen to be special cases of our general functional form. S-box lookup, addition modulo 2/sup 2k/, and X-OR are three frequently occurring operations in the design of symmetric ciphers. We consider two methods of combining these operations and in each apply our main result to obtain the Walsh transform.