Improved meet-in-the-middle attacks on reduced-round des

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

Volumn 4859 LNCS, Issue , 2007, Pages 86-100

  Dunkelman, Orr ^a   Sekar, Gautham ^a   Preneel, Bart ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER CRIME; DATA REDUCTION; TEXT PROCESSING;

CIPHERTEXTS; DATA ENCRYPTION STANDARD (DES); FINANCIAL TRANSACTIONS; PLAINTEXTS;

CRYPTOGRAPHY;

EID: 38349081452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77026-8_8     Document Type: Conference Paper

References (21)

1. Biham, E., Biryukov, A.: An Improvement of Davies' Attack on DES. Journal of Cryptology 10(3), 195-206 (1997)
2. Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer, Heidelberg (1993)
3. Chaum, D., Evertse, J.-H.: Cryptanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 192-211. Springer, Heidelberg (1986)
4. CNET News.com, Users take crack at 56-bit crypto (1997), Available on-line at http://news.com.com/2100-1023-278668.html?legacy-cnet
5. Courtois, N.T., Bard, G.V.: Algebraic Cryptanalysis of the Data Encryption Standard (2006), Available on-line at http://eprint.iacr.oxg/2006/ 402.pdl
6. Davies, D.W.: Investigation of a Potential Weakness in the DES Algorithm, private communications (1987)
7. Davies, D.W., Murphy, S.: Pairs and Triplets of DES S-Boxes. Journal of Cryptology 8(1), 1-25 (1995)
8. Diffie, W., Hellman, M.E.: Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Computer 10(6), 74-84 (1977)
9. Electronic Frontier Foundation, Cracking DES, Secrets of Encryption Research, Wiretap Politics & Chip Design, O'reilly (1998)
10. Hellman, M.E.: A Cryptanalytic Time-Memory Tradeoff. IEEE Transactions on Information Theory 26(4), 401-406 (1980)
11. Knudsen, L.R., Mathiassen, J.E.: A Chosen-Plaintext Linear Attack on DES. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 262-272. Springer, Heidelberg (2001)
12. Kumar, S., Paar, C., Pelzl, J., Pfeiffer, G., Schimmler, M.: Breaking Ciphers with COPACOBANA - A Cost-Optimized Parallel Code Breaker. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 101-118. Springer, Heidelberg (2006)
13. Kunz-Jacques, S., Muller, F.: New Improvements of Davies-Murphy Cryptanalysis. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 425-442. Springer, Heidelberg (2005)
14. Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386-397. Springer, Heidelberg (1994)
15. National Bureau of Standards, Data Encryption Standard, Federal Information Processing Standards Publications No. 46 (1977)
16. Poschmann, A., Leander, G., Schramm, K., Paar, C.: New Light-Weight DES Variants Suited for RFID Applications. In: Proceedings of Fast Software Encryption 14. LNCS, Springer, Heidelberg (to appear, 2007)
17. Raddum, H., Semaev, I.: New Technique for Solving Sparse Equation Systems (2006), Available on-line at http://eprint.iacr.org/2006/47B.pdf
18. Shamir, A.: On the Security of DES. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 280-281, Springer, Heidelberg (1986)
19. Shimoyama, T., Kaneko, T.: Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 200-211. Springer, Heidelberg (1998)
20. RSA Data Security, Team of Universities, Companies and Individual Computer Users Linked Over the Internet Crack RSA's 56-Bit DES Challenge (1997), Available on-line at http://www.rsasecurity.com/news/pr/970619-l.html
21. Wiener, M.J.: Efficient DES Key Search, Technical Report TR-244, Carleton University. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, Springer, Heidelberg (1994)