Attacking triple encryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1372, Issue , 1998, Pages 239-253

  Lucks, Stefan ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MEET-IN-THE-MIDDLE ATTACKS; TRIPLE DES;

CRYPTOGRAPHY;

EID: 84947908749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69710-1_16     Document Type: Conference Paper

References (8)

1. E. Biham, How to forge DES-Encrypted Messages in 228 steps, Technical report CS0884, Computer Science department, Technion, 1996, found in the www3.
2. J. Kelsey, B. Schneier, D. Wagner, \Key-Schedule Cryptanalysis of 3-WAY, IDEA, G-DES, RC4, SAFER, and Triple-DES", Crypto '96, Springer LNCS 1109, 237-251.
3. J. Kilian, P. Rogaway, How to protect DES against exhaustive key search, Crypto '96, Springer LNCS 1109, 252-267, full version found in the www4.
4. A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of applied cryptography, CRC Press, 1997.
5. R.C. Merkle, M.E. Hellman, On the security of multiple encryption Communications of the ACM, Vol. 24, No. 7 (1981).
6. P.C. van Oorschot, M.J. Wiener, A known-plaintext attack on two-key triple encryption, Eurocrypt '90, Springer LNCS 473, 318-325.
7. P.C. van Oorschot, M.J. Wiener, Improving implementable meet-in-the-middle attacks by orders of magnitude Crypto '96, Springer LNCS 1109, 229-236.
8. R.L. Rivest, A. Shamir, PayWord and MicroMint, two simple micropayment schemes, CryptoBytes, Vol. 2, No. 1 (1996), 7-11.