New parallel domain extenders for UOWHF

Wonil Lee, Donghoon Chang, Sangjin Lee, Soohak Sung, Mridul Nandi

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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 [9], 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.

Original languageEnglish
Pages (from-to)208-227
Number of pages20
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2894
Publication statusPublished - 2003 Dec 1

Fingerprint

Sequential Algorithm
Binary Tree
Binary trees
Parallel Algorithms
Mask
Parallel algorithms
Masks
Valid
Sufficient Conditions
Class

Keywords

  • Hash function
  • Masking assignment
  • Parallel construction
  • Sequential construciton
  • Tree based construction
  • UOWHF

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science
  • Engineering(all)

Cite this

New parallel domain extenders for UOWHF. / Lee, Wonil; Chang, Donghoon; Lee, Sangjin; Sung, Soohak; Nandi, Mridul.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2894, 01.12.2003, p. 208-227.

Research output: Contribution to journalArticle

@article{9cc2994705c8409d8adb31226ef9e28f,
title = "New parallel domain extenders for UOWHF",
abstract = "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 [9], 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.",
keywords = "Hash function, Masking assignment, Parallel construction, Sequential construciton, Tree based construction, UOWHF",
author = "Wonil Lee and Donghoon Chang and Sangjin Lee and Soohak Sung and Mridul Nandi",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2894",
pages = "208--227",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - New parallel domain extenders for UOWHF

AU - Lee, Wonil

AU - Chang, Donghoon

AU - Lee, Sangjin

AU - Sung, Soohak

AU - Nandi, Mridul

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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 [9], 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.

AB - 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 [9], 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.

KW - Hash function

KW - Masking assignment

KW - Parallel construction

KW - Sequential construciton

KW - Tree based construction

KW - UOWHF

UR - http://www.scopus.com/inward/record.url?scp=0345490606&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0345490606&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0345490606

VL - 2894

SP - 208

EP - 227

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -