2967 search results - page 287 / 594 » Cryptology |
228
click to vote
FSE
2011
Springer
14 years 10 months ago
2011
Springer
At Eurocrypt 2001, Biryukov and Shamir investigated the security of AES-like ciphers where the substitutions and affine transformations are all key-dependent and successfully crypt...
235
click to vote
FSE
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describe a method to construct a collision in the compression function of ECHO-256 reduced to fou...
215
Voted
PKC
2011
Springer
14 years 9 months ago
2011
Springer
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack co...
201
click to vote
CANS
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
193
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate ...