434 search results - page 8 / 87 » Logical Analysis of Hash Functions |
PRL
2007
13 years 8 months ago
2007
Securing biometrics databases from being compromised is one of the most important challenges that must be overcome in order to demonstrate the viability of biometrics based authen...
FSE
2006
Springer
14 years 6 days ago
2006
Springer
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
IMA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
SACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash fun...