Sciweavers

465 search results - page 3 / 93
» Programmable Hash Functions and Their Applications
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
14 years 11 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
ICSE
2009
IEEE-ACM
15 years 10 months ago
Equality and hashing for (almost) free: Generating implementations from abstraction functions
ng Implementations from Abstraction Functions Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph P. Near, Aleksandar Milicevic and Daniel Jackson Computer Science and Artificial In...
Derek Rayside, Zev Benjamin, Rishabh Singh, Joseph...
CRYPTO
2004
Springer
79views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
Antoine Joux
CRYPTO
1990
Springer
58views Cryptology» more  CRYPTO 1990»
15 years 1 months ago
Structural Properties of One-way Hash Functions
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
ICGA
2008
113views Optimization» more  ICGA 2008»
14 years 10 months ago
Move Generation with Perfect Hash Functions
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
Trevor I. Fenner, Mark Levene