Rotation-Symmetric Functions and Fast Hashing
Rotation-Symmetric Functions and Fast Hashing
复制标题
DOI：
10.3217/jucs-005-01-0020
复制
发表时间：
1998-07
期刊：
影响因子：
--
通讯作者：
J. Pieprzyk;Chengxin Qu
中科院分区：
文献类型：
--
作者：
J. Pieprzyk;Chengxin Qu
高效的哈希是现代密码学的核心。计算技术的进步使我们能够使用64位机器，并有望在不久的将来使用128位机器。为了充分利用快速散列技术，我们需要能够在许多变量中设计密码学上强大的布尔函数，这些函数可以使用前几轮的部分评估来更快地评估。我们引入一类新的布尔函数，其评价是特别有效的，我们称之为旋转对称。在更广泛的对称函数的背景下，旋转对称函数的基本密码学性质进行了研究。给出了旋转对称函数的设计算法，并对两类函数进行了检验。从实用的角度来看，这些课程很重要，因为它们的形式很短。我们发现，缩短旋转对称函数矛盾地导致更昂贵的评估过程。
Efficient hashing is a centerpiece of modern cryptography. The progress in computing technology enables us to use 64-bit machines with the promise of 128-bit machines in the near future. To exploit fully the technology for fast hashing, we need to be able to design cryptographically strong Boolean functions in many variables which can be evaluated faster using partial evaluations from the previous rounds. We introduce a new class of Boolean functions whose evaluation is especially efficient and we call them rotation symmetric. Basic cryptographic properties of rotation-symmetric functions are investigated in a broader context of symmetric functions. An algorithm for the design of rotation-symmetric functions is given and two classes of functions are examined. These classes are important from a practical point of view as their forms are short. We show that shortening of rotation-symmetric functions paradoxically leads to more expensive evaluation process.