Sciweavers

658 search results - page 59 / 132
» The Grindahl Hash Functions
Sort
View
FSE
2009
Springer
148views Cryptology» more  FSE 2009»
15 years 1 months ago
Cryptanalysis of the LAKE Hash Family
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...
Alex Biryukov, Praveen Gauravaram, Jian Guo, Dmitr...
CRYPTO
2006
Springer
129views Cryptology» more  CRYPTO 2006»
14 years 11 months ago
New Proofs for
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
Mihir Bellare
SIGIR
2005
ACM
15 years 3 months ago
Publish/subscribe functionality in IR environments using structured overlay networks
We study the problem of offering publish/subscribe functionality on top of structured overlay networks using data models and languages from IR. We show how to achieve this by ext...
Christos Tryfonopoulos, Stratos Idreos, Manolis Ko...
VMV
2003
151views Visualization» more  VMV 2003»
14 years 11 months ago
Optimized Spatial Hashing for Collision Detection of Deformable Objects
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...
Matthias Teschner, Bruno Heidelberger, Matthias M&...
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen