Sciweavers

5 search results - page 1 / 1
» Analysis of Step-Reduced SHA-256
Sort
View
FSE
2006
Springer
111views Cryptology» more  FSE 2006»
13 years 8 months ago
Analysis of Step-Reduced SHA-256
This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying technique...
Florian Mendel, Norbert Pramstaller, Christian Rec...
FSE
2008
Springer
141views Cryptology» more  FSE 2008»
13 years 6 months ago
Collisions for Step-Reduced SHA-256
In this article we find collisions for step-reduced SHA-256. We develop a differential that holds with high probability if the message satisfies certain conditions. We solve the eq...
Ivica Nikolic, Alex Biryukov
WISA
2007
Springer
13 years 11 months ago
Iteration Bound Analysis and Throughput Optimum Architecture of SHA-256 (384, 512) for Hardware Implementations
Abstract. The hash algorithm forms the basis of many popular cryptographic protocols and it is therefore important to find throughput optimal implementations. Though there have be...
Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
13 years 6 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...
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
13 years 11 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng