杂凑算法的对偶问题
DUAL PROBLEM OF HASH ALGORITHM
-
摘要: 杂凑算法往往具有很高的杂凑速率,如MD_x(x版本的杂凑算法),SHA(数据杂凑标准)等。一个自然的问题是能否利用快速安全的杂凑算法构造相应的分组加密算法呢?本文把这个问题称为杂凑算法的对偶问题,本文试图用现有的结果证明给定一个安全快速的杂凑算法可以构造一个安全快速的分组加密算法。
-
关键词:
- 杂凑算法; 分组加密算法; 对偶问题
Abstract: 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. -
Luby M, Rackoff C. How to construct pseudorandom permutations from pseudorandom functions[J].SIAM Journal on Computing.1988, 17(2):373-386[2]Patarin J. New results on pseudorandom permutation generators based on the DES Scheme, Abstracts of Crypto91, Santa Barbara, CA, USA: 1991, 72-77.[3]Patarin J. How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In Abstracts of Eurocrypt92, Balatonfured, Hungary: 1992, 235-245.[4]朱华飞.密码安全杂凑算法的设计与应用:[博士论文].西安:西安电子科技大学,1996年10月. -
计量
- 文章访问数: 1972
- HTML全文浏览量: 123
- PDF下载量: 431
- 被引次数: 0
下载:
