Sciweavers

268 search results - page 13 / 54
» An Analysis of Bitstate Hashing
Sort
View
IBPRIA
2003
Springer
14 years 1 months ago
Hash-Like Fractal Image Compression with Linear Execution Time
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
Kostadin Koroutchev, José R. Dorronsoro
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy
CVPR
2010
IEEE
14 years 3 months ago
Rapid Face Recognition Using Hashing
We propose a face recognition approach based on hashing. The approach yields comparable recognition rates with the random 1 approach [18], which is considered the stateof-the-art....
Qinfeng Shi, Hanxi Li, Chunhua Shen
CRYPTO
2007
Springer
149views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
Hash Functions and the (Amplified) Boomerang Attack
Abstract. Since Crypto 2004, hash functions have been the target of many attacks which showed that several well-known functions such as SHA-0 or MD5 can no longer be considered sec...
Antoine Joux, Thomas Peyrin
SACRYPT
2009
Springer
141views Cryptology» more  SACRYPT 2009»
14 years 2 months ago
Cryptanalysis of Dynamic SHA(2)
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash fun...
Jean-Philippe Aumasson, Orr Dunkelman, Sebastiaan ...