On the Practical (In-) Security of 64-bit Block Ciphers

被引:76
作者
Bhargavan, Karthikeyan [1 ]
Leurent, Gaetan [1 ]
机构
[1] Inria, Rocquencourt, France
来源
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY | 2016年
关键词
D O I
10.1145/2976749.2978423
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
While modern block ciphers, such as AES, have a block size of at least 128 bits, there are many 64-bit block ciphers, such as 3DES and Blow fish, that are still widely supported in Internet security protocols such as TLS, SSH, and IPsec. When used in CBC mode, these ciphers are known to be susceptible to collision attacks when they are used to encrypt around 2(32) blocks of data (the so-called birthday bound). This threat has traditionally been dismissed as impractical since it requires some prior knowledge of the plaintext and even then, it only leaks a few secret bits per gigabyte. Indeed, practical collision attacks have never been demonstrated against any mainstream security protocol, leading to the continued use of 64-bit ciphers on the Internet. In this work, we demonstrate two concrete attacks that exploit collisions on short block ciphers. First, we present an attack on the use of 3DES in HTTPS that can be used to recover a secret session cookie. Second, we show how a similar attack on Blow fish can be used to recover HTTP BasicAuth credentials sent over OpenVPN connections. In our proof-of-concept demos, the attacker needs to capture about 785GB of data, which takes between 19-38 hours in our setting. This complexity is comparable to the recent RC4 attacks on TLS: the only fully implemented attack takes 75 hours. We evaluate the impact of our attacks by measuring the use of 64-bit block ciphers in real-world protocols. We discuss mitigations, such as disabling all 64-bit block ciphers, and report on the response of various software vendors to our responsible disclosure of these attacks.
引用
收藏
页码:456 / 467
页数:12
相关论文
共 34 条
[1]  
Abdalla M, 2000, LECT NOTES COMPUT SC, V1976, P546
[2]   Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice [J].
Adrian, David ;
Bhargavan, Karthikeyan ;
Durumeric, Zakir ;
Gaudry, Pierrick ;
Green, Matthew ;
Halderman, J. Alex ;
Heninger, Nadia ;
Springall, Drew ;
Thome, Emmanuel ;
Valenta, Luke ;
VanderSloot, Benjamin ;
Wustrow, Eric ;
Zanella-Beguelin, Santiago ;
Zimmermann, Paul .
CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, :5-17
[3]  
AlFardan N., 2013, P 22 USENIX SEC S, P305
[4]   Lucky Thirteen: Breaking the TLS and DTLS Record Protocols [J].
AlFardan, Nadhem J. ;
Paterson, Kenneth G. .
2013 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2013, :526-540
[5]  
[Anonymous], 2014, 1SC27 ISOIEC JTC
[6]  
[Anonymous], 4344 IETF RFC
[7]  
Aviram N., 2016, DROWN BREAKING TLS U
[8]   A concrete security treatment of symmetric encryption [J].
Bellare, M ;
Desai, A ;
Jokipii, E ;
Rogaway, P .
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, :394-403
[9]  
Bellare M., 1994, Advances in Cryptology - CRYPTO '94. 14th Annual International Cryptology Conference. Proceedings, P341
[10]   A Messy State of the Union: Taming the Composite State Machines of TLS [J].
Beurdouche, Benjamin ;
Bhargavan, Karthikeyan ;
Delignat-Lavaud, Antoine ;
Fournet, Cedric ;
Kohlweiss, Markulf ;
Pironti, Alfredo ;
Strub, Pierre-Yves ;
Zinzindohoue, Jean Karim .
2015 IEEE SYMPOSIUM ON SECURITY AND PRIVACY SP 2015, 2015, :535-552