Sciweavers

1262 search results - page 20 / 253
» Fast Robust Hashing
Sort
View
JCST
2007
97views more  JCST 2007»
13 years 8 months ago
Improved Collision Attack on Hash Function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that ...
Jie Liang, Xue-Jia Lai
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
14 years 3 months ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 10 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
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
ICIP
2010
IEEE
13 years 6 months ago
Multimedia forensic hash based on visual words
In recent years, digital images and videos have become increasingly popular over the internet and bring great social impact to a wide audience. In the meanwhile, technology advanc...
Wenjun Lu, Min Wu