Imperfect forward secrecy

Author:

Adrian David1,Bhargavan Karthikeyan2,Durumeric Zakir1,Gaudry Pierrick3,Green Matthew4,Halderman J. Alex5,Heninger Nadia6,Springall Drew1,Thomé Emmanuel3,Valenta Luke6,VanderSloot Benjamin1,Wustrow Eric1,Zanella-Béguelin Santiago7,Zimmermann Paul3

Affiliation:

1. University of Michigan, Ann Arbor, MI

2. INRIA Paris-Rocquencourt, Paris, France

3. INRIA Nancy-Grand Est, CNRS, and Université de Lorraine, France

4. Johns Hopkins University, Baltimore, MD

5. University of Michigan, Ann Arbor

6. University of Pennsylvania, Philadelphia, PA

7. Microsoft Research, Cambridge, England

Abstract

We investigate the security of Diffie-Hellman key exchange as used in popular Internet protocols and find it to be less secure than widely believed. First, we present Logjam, a novel flaw in TLS that lets a man-in-the-middle downgrade connections to "export-grade" Diffie-Hellman. To carry out this attack, we implement the number field sieve discrete logarithm algorithm. After a week-long precomputation for a specified 512-bit group, we can compute arbitrary discrete logarithms in that group in about a minute. We find that 82% of vulnerable servers use a single 512-bit group, and that 8.4% of Alexa Top Million HTTPS sites are vulnerable to the attack. In response, major browsers have changed to reject short groups. We go on to consider Diffie-Hellman with 768- and 1024-bit groups. We estimate that even in the 1024-bit case, the computations are plausible given nation-state resources. A small number of fixed or standardized groups are used by millions of servers; performing precomputation for a single 1024-bit group would allow passive eavesdropping on 18% of popular HTTPS sites, and a second group would allow decryption of traffic to 66% of IPsec VPNs and 26% of SSH servers. A close reading of published NSA leaks shows that the agency's attacks on VPNs are consistent with having achieved such a break. We conclude that moving to stronger key exchange methods should be a priority for the Internet community.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Continued Fractions Applied to the One Line Factoring Algorithm for Breaking RSA;Journal of Cybersecurity and Privacy;2024-01-10

2. An Analysis on the Implementation of Secure Web-Related Protocols in Portuguese City Councils;International Journal of Marketing, Communication and New Media;2023-02-28

3. Modes of information flow in collective cohesion;Science Advances;2022-02-11

4. Text Multilevel Encryption Using New Key Exchange Protocol;Baghdad Science Journal;2021-11-20

5. $\text{DY}^{\star}$: A Modular Symbolic Verification Framework for Executable Cryptographic Protocol Code;2021 IEEE European Symposium on Security and Privacy (EuroS&P);2021-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3