ArticleslgStudy

computer science

Nadia Heninger

Nadia Heninger is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Nadia Heninger rather than just read about it. In short: Nadia Heninger (born 1982) 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,[A] for her discovery that weak keys for the RSA cryptosystem are in widesprea…

Nadia Heninger — main illustration
Nadia Heninger — illustration

Key takeaways

  • Nadia Heninger belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Nadia Heninger to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Nadia Heninger from memory before moving on to harder problems.

Reference excerpt

Nadia Heninger (born 1982) 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,[A] for her discovery that weak keys for the RSA cryptosystem are in widespread use by internet routers and other embedded devices,[B] 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,[C] and for the DROWN attack, which uses servers supporting old and weak cryptography to decrypt traffic from modern clients to modern servers.[D] Heninger's other research contributions include a variant of the RSA cryptosystem that would be secure against quantum computers, an attack on implementations of the ANSI X9.31 cryptographically secure pseudorandom number generator that use hard-coded seed keys to initialize the generator, and the discovery of a side-channel attack against some versions of the libgcrypt cryptography library. In 2015, Heninger was part of a team of proponents that included Matt Blaze, Steven M. Bellovin, J. Alex Halderman, and Andrea M. Matwyshyn who successfully proposed a security research exemption to Section 1201 of the Digital Millennium Copyright Act. In 2025 Heninger was part of a team team that included Wenyi “Morty” Zhang, Annie Dai, Keegan Ryan, Dave Levin, and Aaron Schulman who with just $800 in basic equipment, found a stunning variety of data—including thousands of T-Mobile users' calls and texts and even US military communications—sent by satellites unencrypted. Their paper won the 2025 CCS distinguished paper award and was featured in Wired Magazine

Education and career Heninger graduated from the University of California, Berkeley in 2004, with a bachelor's degree in electrical engineering and computer science. She completed her doctorate in 2011 at Princeton University; her dissertation, Error Correction and the Cryptographic Key, was supervised by Bernard Chazelle. After postdoctoral research at the University of California, San Diego and Microsoft Research in New England, she became Magerman Term Assistant Professor at the University of Pennsylvania in 2013. In 2019, she returned to the University of California, San Diego.

Recognition Heninger's work on weak keys and on forward secrecy of Diffie–Hellman won best paper awards at the conferences at which they were presented, as have several of Heninger's other publications. She is one of the 2016 recipients of the Applied Networking Research Prize of the Internet Research Task Force. She was an invited speaker at Asiacrypt 2016, speaking on "The reality of cryptographic deployments on the internet". She is a 2026 International Association for Cryptologic Research Fellow for impactful contributions to the analysis of deployed cryptographic protocols and service to the IACR and the wider security community.

Selected publications

References

External links Home page Nadia Heninger publications indexed by Google Scholar

Illustrations

Nadia Heninger illustration

Worked examples

Example 1 — a first encounter with Nadia Heninger

Start with the simplest possible case. Write down what Nadia Heninger claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Nadia Heninger before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Nadia Heninger ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Nadia Heninger

In research
Nadia Heninger appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Nadia Heninger in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Nadia Heninger is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1982 births, 21st-century American mathematicians, 21st-century American women mathematicians, so understanding it makes those chapters shorter.
In everyday life
Look for Nadia Heninger outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Nadia Heninger” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Nadia Heninger in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Nadia Heninger means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Nadia Heninger out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Nadia Heninger in simple terms?

Nadia Heninger (born 1982) 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 secre…

Why does Nadia Heninger matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Nadia Heninger?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Nadia Heninger.

Tags

  • 1982 births
  • 21st-century American mathematicians
  • 21st-century American women mathematicians
  • American computer scientists
  • American cryptographers
  • American number theorists
  • American women computer scientists
  • American women cryptographers
  • Living people
  • Princeton University alumni
  • Public-key cryptographers
  • University of California, Berkeley alumni

Keep exploring