62 search results - page 3 / 13 » Harmonic Functions and Collision Probabilities |
FSE
2008
Springer
13 years 6 months ago
2008
Springer
In this paper, we point out some weaknesses in the Salsa20 core function that could be exploited to obtain up to 231 collisions for its full (20 rounds) version. We first find an i...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
EUROCRYPT
2010
Springer
13 years 8 months ago
2010
Springer
At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, then a collision for F can be ...
IAT
2009
IEEE
14 years 1 days ago
2009
IEEE
Application of autonomous intelligent systems into airspace domain is very important nowadays. The paper presents decentralized collision avoidance algorithm utilizing a solution ...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...