DOI QR코드

DOI QR Code

UOWHF 구생방법 : 최적의 키 길이를 가자는 새로운 병렬 도메인 확장기

Construction of UOWHF: New Parallel Domain Extender with Optimal Key Size

  • 발행 : 2004.02.01

초록

본 논문에서는 UOWHF의 도메인을 확장하기 위한 새로운 병렬 처리 알고리즘을 제안한다. 제시되는 알고리즘은 non-complete l-ary tree 에 기반을 두고 있으며 현재까지 최적의 키 길이를 가진 유일한 알고리즘인 Shoup 의 알고리즘과 동일한 최적의 키 길이를 가진다. 또한 Sarkar의 결과를 이용하여 본 논문에서 제시되는 알고리즘이 Shoup의 알고리즘과 함께 Sarkar가 제시한 도메인 확장 알고리즘들의 커다란 집합 중에서 가장 최적화된 키 길이를 가짐을 증명한다. 그러나 제안 알고리즘의 병렬처리능력은 complete tree에 기반 한 구성 방법들 보다 약간 비효율적이다. 그러나 만약 l이 점점 커진다면 알고리즘의 병렬처리능력도 complete tree 에 기반 한 방법들에 가까워진다.

We present a new parallel algorithm for extending the domain of a UOWHF. Our 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 [8], 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 prallelizability 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.tructions.

키워드

참고문헌

  1. Advances in Cryptology-Crypto'97, Lecture Notes in Computer Science v.1294 Collision-resistant hashing:towards making UOWHFs practical M.Bellard;P.Rogaway
  2. Advances in Cryptology-Crypto'89, Lecture Notes in Computer Sciences v.435 A design principle for hash functions I.B.Damgard
  3. Advances in Cryptology-Crypto'89, Lecture Notes in Computer Sciences v.435 One way hash funtions and DES R.Merkle
  4. Advances in Cryptology-Eurocrypt'01, Lecture Notes in Computer Sciences v.2045 Hash functions:from Merkle-Damgard to Shoup I.Mironov
  5. Cryptology ePrint Archive A new Tree based Domain Extension of UOWHF M.Nandi
  6. Proceeding of the Twenty First Annual ACM Symposium on Theory of Computing Universal one-way hash functions and their cryptographic applications M.Naor;M.Yung
  7. Cryptology ePrint Archive Construction of UOWHF:Tree Hashing Revisited P.Sarkar
  8. Cryptology eprint Archive Domain Extedders for UOWHF:A Generic Lower Bound on Key Expansion and a Finite Binary Tree Algorithm P.Sarkar
  9. Advances in Cryptology-Eurocrypt'00, Lecture Notes in Computer Science v.1807 A composition theorem for universal one-way hash functions V.Shoup
  10. Advances in Cryptology-Eurocrypt'98, Lecture Notes in Computer Science v.1403 Finding collisions on a one-way street:can secure hash functions be based on general assumptions? D.Simon