143 search results - page 25 / 29 » Hash, Displace, and Compress |
ALGORITHMICA
1998
13 years 7 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
FSE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We provide the first proof of security for Tandem-DM, one of the oldest and most wellknown constructions for turning a blockcipher with n-bit blocklength and 2n-bit keyle...
FSE
2011
Springer
12 years 11 months ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
EIT
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Audio Fingerprints (AFP’s) are compact, content-based representations of audio signals used to measure distances among them. An AFP has to be small, fast computed and robust to ...