Sciweavers

713 search results - page 51 / 143
» Dispersing Hash Functions
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
Linearization Framework for Collision Attacks: Application to CubeHash and MD6
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...
Eric Brier, Shahram Khazaei, Willi Meier, Thomas P...
FSE
2009
Springer
106views Cryptology» more  FSE 2009»
15 years 10 months ago
Practical Collisions for EnRUPT
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete has...
Sebastiaan Indesteege, Bart Preneel
IMA
2009
Springer
124views Cryptology» more  IMA 2009»
15 years 4 months ago
Comparing with RSA
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
Julien Cathalo, David Naccache, Jean-Jacques Quisq...
ASIACRYPT
2004
Springer
15 years 3 months ago
On Provably Secure Time-Stamping Schemes
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
Ahto Buldas, Märt Saarepera
CARDIS
1998
Springer
110views Hardware» more  CARDIS 1998»
15 years 2 months ago
Reducing the Collision Probability of Alleged Comp128
Wagner, Goldberg and Briceno have recently published an attack [2] on what they believe to be Comp128, the GSM A3A8 authentication hash function [1]. Provided that the attacker has...
Helena Handschuh, Pascal Paillier