74 search results - page 6 / 15 » A Key Recovery Attack on Edon80 |
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
ACISP
2006
Springer
14 years 1 months ago
2006
Springer
EUROCRYPT
2010
Springer
14 years 13 days ago
2010
Springer
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 299.5 time and data complex...
CISC
2009
Springer
13 years 5 months ago
2009
Springer
In [10], Buchmann, Pyshkin and Weinmann have described two families of Feistel and SPN block ciphers called Flurry and Curry respectively. These two families of ciphers are fully p...