Sciweavers

10 search results - page 1 / 2
» Exploiting Coding Theory for Collision Attacks on SHA-1
Sort
View
IMA
2005
Springer
113views Cryptology» more  IMA 2005»
13 years 10 months ago
Exploiting Coding Theory for Collision Attacks on SHA-1
In this article we show that coding theory can be exploited efficiently for the cryptanalysis of hash functions. We will mainly focus
Norbert Pramstaller, Christian Rechberger, Vincent...
SECRYPT
2007
121views Business» more  SECRYPT 2007»
13 years 6 months ago
Using Steganography to Improve Hash Functions' Collision Resistance
Lately, hash function security has received increased attention. Especially after the recent attacks that were presented for SHA-1 and MD5, the need for a new and more robust hash...
Emmanouel Kellinis, Konstantinos Papapanagiotou
ISW
2009
Springer
13 years 11 months ago
Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
The recently started SHA-3 competition in order to find a new secure hash standard and thus a replacement for SHA-1/SHA-2 has attracted a lot of interest in the academic world as ...
Mario Lamberger, Florian Mendel
INDOCRYPT
2007
Springer
13 years 10 months ago
Linearization Attacks Against Syndrome Based Hashes
Abstract. In MyCrypt 2005, Augot, Finiasz, and Sendrier proposed FSB, a family of cryptographic hash functions. The security claim of the FSB hashes is based on a coding theory pro...
Markku-Juhani Olavi Saarinen
MYCRYPT
2005
Springer
248views Cryptology» more  MYCRYPT 2005»
13 years 10 months ago
A Family of Fast Syndrome Based Cryptographic Hash Functions
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
Daniel Augot, Matthieu Finiasz, Nicolas Sendrier