Nadia Heninger
American cryptographer, computer security expert
Nadia Heninger's AcademicInfluence.com Rankings
Download Badge
Criminal Justice Computer Science Mathematics
Nadia Heninger's Degrees
- PhD Computer Science Princeton University
Similar Degrees You Can Earn
Why Is Nadia Heninger Influential?
(Suggest an Edit or Addition)According to Wikipedia, Nadia Heninger is an American cryptographer, computer security expert, and computational number theorist at the University of California, San Diego. Contributions Heninger is known for her work on freezing powered-down security devices to slow their fading memories and allow their secrets to be recovered via a cold boot attack, for her discovery that weak keys for the RSA cryptosystem are in widespread use by internet routerss and other embedded devices, for her research on how failures of forward secrecy in bad implementations of the Diffie–Hellman key exchange may have allowed the National Security Agency to decrypt large amounts of internet traffic via the Logjam vulnerability, and for the DROWN attack, which uses servers supporting old and weak cryptography to decrypt traffic from modern clients to modern servers.
Nadia Heninger's Published Works
Published Works
- Lest we remember: cold-boot attacks on encryption keys (2008) (1353)
- Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice (2015) (425)
- Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices (2012) (412)
- Elliptic Curve Cryptography in Practice (2014) (227)
- CacheBleed: a timing attack on OpenSSL constant-time RSA (2017) (210)
- DROWN: Breaking TLS Using SSLv2 (2016) (153)
- Reconstructing RSA Private Keys from Random Key Bits (2009) (148)
- Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs (2010) (143)
- Optimally Robust Private Information Retrieval (2012) (118)
- Factoring RSA keys from certified smart cards: Coppersmith in the wild (2013) (102)
- Fingerprinting Blank Paper Using Commodity Scanners (2009) (100)
- Approximate common divisors via lattices (2011) (95)
- A Systematic Analysis of the Juniper Dual EC Incident (2016) (78)
- CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks (2018) (65)
- CacheBleed: a timing attack on OpenSSL constant-time RSA (2016) (60)
- Sliding Right into Disaster: Left-to-Right Sliding Windows Leak (2017) (56)
- Biased Nonce Sense: Lattice Attacks against Weak ECDSA Signatures in Cryptocurrencies (2019) (50)
- TPM-FAIL: TPM meets Timing and Lattice Attacks (2019) (50)
- Post-quantum RSA (2017) (49)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (2016) (48)
- Factoring as a Service (2016) (47)
- Weak Keys Remain Widespread in Network Devices (2016) (43)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (2010) (40)
- Torchestra: reducing interactive traffic delays over tor (2012) (37)
- Measuring small subgroup attacks against Diffie-Hellman (2017) (30)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (2020) (30)
- CopyCat: Controlled Instruction-Level Attacks on Enclaves (2020) (24)
- Pseudorandom Black Swans: Cache Attacks on CTR_DRBG (2020) (23)
- In Search of CurveSwap: Measuring Elliptic Curve Implementations in the Wild (2018) (15)
- On the integrality of nth roots of generating functions (2005) (14)
- On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem (2020) (13)
- Practical State Recovery Attacks against Legacy RNG Implementations (2018) (12)
- CopyCat: Controlled Instruction-Level Attacks on Enclaves for Maximal Key Extraction (2020) (11)
- Recovering cryptographic keys from partial information, by example (2020) (10)
- Imperfect forward secrecy (2018) (9)
- Where did I leave my keys? (2018) (7)
- Improved RSA Private Key Reconstruction for Cold Boot Attacks (2008) (4)
- BITCOIN: Cryptography, Economics, and the Future (2013) (4)
- Short Paper: The Proof is in the Pudding (2019) (4)
- The Proof is in the Pudding: Proofs of Work for Solving Discrete Logarithms (2018) (4)
- Conceptual Modeling (2012) (3)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith's Method for Univariate Polynomials (2016) (3)
- Cellular Network Security (2011) (3)
- Error correction and the cryptographic key (2011) (3)
- The State of the Art in Integer Factoring and Breaking Public-Key Cryptography (2022) (2)
- RSA, DH, and DSA in the Wild (2021) (2)
- Open to a fault: On the passive compromise of TLS keys via transient errors (2022) (2)
- Computational Complexity and Information Asymmetry in Election Audits with Low-Entropy Randomness (2010) (2)
- Tales From the Crypto Community (2013) (1)
- Characterizing overstretched NTRU attacks (2020) (1)
- Fast Practical Lattice Reduction through Iterated Compression (2023) (1)
- Financial Cryptography and Data Security: 24th International Conference, FC 2020 , Kota Kinabalu, Malaysia, February 10–14, 2020 Revised Selected Papers (2020) (1)
- Properties of constacyclic codes under the Schur product (2018) (1)
- Cryptanalyzing MEGA in Six Queries (2022) (0)
- Cold-Boot Attacks (2011) (0)
- Properties of constacyclic codes under the Schur product (2020) (0)
- SECURITY STORAGE SYSTEM FOR CLOUD USER USING OSD WITH A SELF-DESTRUCTING DATA (2014) (0)
- On the Possibility of a Backdoor in the Micali-Schnorr Generator (2023) (0)
- Cryptographic Protocol (2011) (0)
- Two variable polynomial congruences and capacity theory (2021) (0)
- The Hidden Number Problem with Small Unknown Multipliers: Cryptanalyzing MEGA in Six Queries and Other Applications (2023) (0)
- On squares, cubes, ... in Z[[x]]* (2005) (0)
- ANTS X Proceedings of the Tenth Algorithmic Number Theory Symposium msp Approximate common divisors via lattices (2013) (0)
- Credential Verification (2011) (0)
- The Mathematics of Cryptographic Security (2017) (0)
This paper list is powered by the following services:
Other Resources About Nadia Heninger
What Schools Are Affiliated With Nadia Heninger?
Nadia Heninger is affiliated with the following schools: