122 search results - page 2 / 25 » Reducing the Storage Requirements of a Perfect Hash Function |
ALENEX
2009
13 years 6 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
WEA
2005
Springer
13 years 10 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
CHES
2007
Springer
13 years 11 months ago
2007
Springer
This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications reduced hardware requirements. MAME takes a 25...
JDCTA
2008
13 years 5 months ago
2008
In WSNs, since the attacks, such as jamming or eavesdropping without physical access, easily occur, security is one of the important requirements for WSNs. The key pre-distributio...
FSE
2006
Springer
13 years 9 months ago
2006
Springer
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...