Sciweavers

109 search results - page 5 / 22
» Analysis of All-or-Nothing Hash Functions
Sort
View
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
14 years 2 months ago
Collisions and Near-Collisions for Reduced-Round Tiger
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...
John Kelsey, Stefan Lucks
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
13 years 10 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
CTRSA
2006
Springer
129views Cryptology» more  CTRSA 2006»
14 years 2 months ago
An Optimal Non-interactive Message Authentication Protocol
Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SASbased non-interactive message aut...
Sylvain Pasini, Serge Vaudenay
MYCRYPT
2005
Springer
248views Cryptology» more  MYCRYPT 2005»
14 years 4 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
IJNSEC
2008
98views more  IJNSEC 2008»
13 years 11 months ago
An Update on the Analysis and Design of NMAC and HMAC Functions
In this paper, we investigate the issues in the analysis and design of provably secure message authentication codes (MACs) Nested MAC (NMAC) and Hash based MAC (HMAC) proposed by ...
Praveen Gauravaram, Shoichi Hirose, Suganya Annadu...