雜湊算法的對(duì)偶問題
DUAL PROBLEM OF HASH ALGORITHM
-
摘要: 雜湊算法往往具有很高的雜湊速率,如MD_x(x版本的雜湊算法),SHA(數(shù)據(jù)雜湊標(biāo)準(zhǔn))等。一個(gè)自然的問題是能否利用快速安全的雜湊算法構(gòu)造相應(yīng)的分組加密算法呢?本文把這個(gè)問題稱為雜湊算法的對(duì)偶問題,本文試圖用現(xiàn)有的結(jié)果證明給定一個(gè)安全快速的雜湊算法可以構(gòu)造一個(gè)安全快速的分組加密算法。
-
關(guān)鍵詞:
- 雜湊算法; 分組加密算法; 對(duì)偶問題
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]朱華飛.密碼安全雜湊算法的設(shè)計(jì)與應(yīng)用:[博士論文].西安:西安電子科技大學(xué),1996年10月. -
計(jì)量
- 文章訪問數(shù): 1980
- HTML全文瀏覽量: 127
- PDF下載量: 431
- 被引次數(shù): 0
下載:
