378 search results - page 13 / 76 » A Traceable Block Cipher |
DCC
2009
IEEE
14 years 4 months ago
2009
IEEE
This paper investigates compression of encrypted data. It has been previously shown that data encrypted with Vernam’s scheme [1], also known as the one-time pad, can be compress...
ASIACRYPT
2000
Springer
14 years 1 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. ...
FSE
2011
Springer
13 years 1 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...
FSE
2006
Springer
14 years 1 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
13 years 7 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...