摘要
杂凑算法往往具有很高的杂凑速率,如MD_x(x版本的杂凑算法),SHA(数据杂凑标准)等。一个自然的问题是能否利用快速安全的杂凑算法构造相应的分组加密算法呢?本文把这个问题称为杂凑算法的对偶问题,本文试图用现有的结果证明给定一个安全快速的杂凑算法可以构造一个安全快速的分组加密算法。
Hash algorithm is always with high operation speed such as MDx, SHA. A natural problem is that could one apply for a fast hash scheme to construct a cipher block algorithm. This paper denotes such a problem as dual problem of hash algorithm. Based on the known result, it is proved that several fast secure block cipher can be constructed if a fast secure hash algorithm is given.
基金
国家自然科学基金
