396 search results - page 13 / 80 » Contemporary Block Ciphers |
122
Voted
ASIACRYPT
2000
Springer
15 years 4 months ago
2000
Springer
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. ...
137
click to vote
FSE
2011
Springer
14 years 3 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...
173
click to vote
CRYPTO
1999
Springer
15 years 4 months ago
1999
Springer
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
100
click to vote
FSE
2006
Springer
15 years 4 months ago
2006
Springer
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized different...
CISC
2009
Springer
14 years 10 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...