Sciweavers

658 search results - page 58 / 132
» The Grindahl Hash Functions
Sort
View
FSE
2008
Springer
177views Cryptology» more  FSE 2008»
14 years 11 months ago
MD4 is Not One-Way
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
Gaëtan Leurent
ICDCSW
2003
IEEE
15 years 3 months ago
Foundations of Security for Hash Chains in Ad Hoc Networks
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...
Phillip G. Bradford, Olga V. Gavrylyako
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
15 years 10 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
FSE
2009
Springer
152views Cryptology» more  FSE 2009»
15 years 10 months ago
Blockcipher-Based Hashing Revisited
We revisit the rate-1 blockcipher based hash functions as first studied by Preneel, Govaerts and Vandewalle (Crypto'93) and later extensively analysed by Black, Rogaway and Sh...
Martijn Stam
CISC
2007
Springer
111views Cryptology» more  CISC 2007»
15 years 4 months ago
Multivariates Polynomials for Hashing
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
Jintai Ding, Bo-Yin Yang