Sciweavers

2967 search results - page 273 / 594
» Cryptology
Sort
View
EUROCRYPT
2010
Springer
15 years 10 months ago
Stam's Collision Resistance Conjecture
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 ...
John P. Steinberger
FSE
2009
Springer
148views Cryptology» more  FSE 2009»
15 years 10 months ago
Cryptanalysis of the LAKE Hash Family
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...
Alex Biryukov, Praveen Gauravaram, Jian Guo, Dmitr...
ASIACRYPT
2008
Springer
15 years 8 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
ASIACRYPT
2008
Springer
15 years 8 months ago
A New Attack on the LEX Stream Cipher
Abstract. In [6], Biryukov presented a new methodology of stream cipher design, called leak extraction. The stream cipher LEX, based on this methodology and on the AES block cipher...
Orr Dunkelman, Nathan Keller
ASIACRYPT
2008
Springer
15 years 8 months ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim