Construction of UOWHF : Two New Parallel Methods(Symmetric Key Cryptography)(<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar's construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup's sequential algorithm. But it is not too large as in all practical situations we need just two more masks than Shoup's. Our second algorithm is based on non-complete l-ary tree and has the same optimal key length expansion as Shoup's which has the most efficient key length expansion known so far. Using the recent result [10], we can also prove that the key length expansion of this algorithm and Shoup's sequential algorithm are the minimum possible for any algorithms in a large class of "natural" domain extending algorithms. But its parallelizability performance is less efficient than complete tree based constructions. However if l is getting larger, then the parallelizability of the construction is also getting near to that of complete tree based constructions. We also give a sufficient condition for valid domain extension in sequential domain extension.
- 社団法人電子情報通信学会の論文
- 2005-01-01
著者
-
LEE Sangjin
Center for Information Security Technologies, Korea University
-
Lee S
Center For Information Security Technologies (cist) Korea University
-
Lee Sangjin
Center For Information Security Technologies (cist) Korea University
-
CHANG Donghoon
Center for Information and Security Technologies, Korea University
-
LEE Wonil
Center for Information and Security Technologies, Korea University
-
Nandi Muralidhar
Applied Statistics Unit Indian Statistical Institute
-
Chang D
Center For Information Security Technologies (cist) Korea University
-
Chang Donghoon
Center For Information And Security Technologies Korea University
-
SUNG Soohak
Department of Applied Mathematics, Paichai University
-
NANDI Mridul
Applied Statistics Unit, Indian Statistical Institute
-
Lee W
Faculty Of Information Science And Electrical Engineering Kyushu University
-
Lee Wonil
Center For Information And Security Technologies Korea University
-
Sung Soohak
Department Of Applied Mathematics Paichai University
関連論文
- DRBAC Model Using a WSNM for Services in i-Home(New Technologies and their Applications of the Internet IV)
- 擬似ランダム関数族の定義に関する考察
- Seven New Block Cipher Structures with Provable Security against Differential Cryptanalysis
- Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function
- Impossible Differential Cryptanalysis of Zodiac(Special Section on Cryptography and Information Security)
- Construction of UOWHF : Two New Parallel Methods(Symmetric Key Cryptography)(Cryptography and Information Security)
- PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis(Symmetric Key Cryptography)(Cryptography and Information Security)
- Additive Noise Response of a Charge Pump Phase-Locked Loop
- Linear Attack Using Multiple Linear Approximations(Symmetric Key Cryptography)(Cryptography and Information Security)
- A Genetic Optimization Approach to Operation of a Multi-head Surface Mounting Machine