Sciweavers

658 search results - page 24 / 132
» The Grindahl Hash Functions
Sort
View
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
The Collision Security of Tandem-DM in the Ideal Cipher Model
We prove that Tandem-DM, one of the two “classical” schemes for turning a blockcipher of 2n-bit key into a double block length hash function, has birthday-type collision resist...
Jooyoung Lee, Martijn Stam, John P. Steinberger
ICCD
2007
IEEE
140views Hardware» more  ICCD 2007»
14 years 11 days ago
Continual hashing for efficient fine-grain state inconsistency detection
Transaction-level modeling (TLM) allows a designer to save functional verification effort during the modular refinement of an SoC by reusing the prior implementation of a module a...
Jae W. Lee, Myron King, Krste Asanovic
ICASSP
2011
IEEE
13 years 7 days ago
Fully non-local super-resolution via spectral hashing
Super-resolution is the task of creating an high resolution image from a low resolution input sequence. To overcome the difficulties of fine image registration, several methods ...
Emmanuel d'Angelo, Pierre Vandergheynst
ASIACRYPT
2007
Springer
14 years 2 months ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 7 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang