Sciweavers

658 search results - page 60 / 132
» The Grindahl Hash Functions
Sort
View
FSE
2010
Springer
140views Cryptology» more  FSE 2010»
15 years 2 months ago
Cryptanalysis of ESSENCE
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
María Naya-Plasencia, Andrea Röck, Jea...
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
14 years 11 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...
IEICET
2008
147views more  IEICET 2008»
14 years 9 months ago
Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with a...
Donghoon Chang, Mridul Nandi, Jesang Lee, Jaechul ...
IEEEARES
2008
IEEE
15 years 4 months ago
haplog: A Hash-Only and Privacy-Preserved Secure Logging Mechanism
A secure logging mechanism named haplog is proposed. In essence, haplog uses only one-way hash functions to achieve the security and functional requirements of logging. This makes...
Chih-Yin Lin
ACISP
2008
Springer
15 years 4 months ago
Non-linear Reduced Round Attacks against SHA-2 Hash Family
Most of the attacks against (reduced) SHA-2 family in literature have used local collisions which are valid for linearized version of SHA-2 hash functions. Recently, at FSE ’08, ...
Somitra Kumar Sanadhya, Palash Sarkar