Imperfect Forward Secrecy
Top Cited Papers
Open Access
- 12 October 2015
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 62 (1) , 5-17
- https://doi.org/10.1145/2810103.2813707
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 log algorithm. After a week-long precomputation for a specified 512-bit group, we can compute arbitrary discrete logs in that group in about a minute. We find that 82% of vulnerable servers use a single 512-bit group, allowing us to compromise connections to 7% of Alexa Top Million HTTPS sites. In response, major browsers are being 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.Keywords
Funding Information
- NSF (CNS-1409505, DGE-1256260, EFRI-1441209, CNS-1518741, CNS-1345254)
- ONR (N00014-11-1-0470)
- ERC (259639)
- ANR (ANR-12-BS02-001-01)
This publication has 36 references indexed in Scilit:
- Virtual logarithmsJournal of Algorithms, 2005
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer methodMathematics of Computation, 2002
- Special prime numbers and discrete logs in finite prime fieldsMathematics of Computation, 2000
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann AlgorithmMathematics of Computation, 1994
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- The number field sieveLecture Notes in Mathematics, 1993
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- Class number, a theory of factorization, and generaPublished by American Mathematical Society (AMS) ,1971