Sciweavers

6 search results - page 2 / 2
» Collisions for Step-Reduced SHA-256
Sort
View
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...