Cryptography Research & Achievements
Cryptography Research & Achievements
December 2004, B.S. in electrical engineering and computer science with high honors,
University of California, Berkeley
1 of 16
Best Paper Award, USENIX Security 2012
NSF Mathematical Sciences Postdoctoral Research Fellowship, 2011–2013
Best Student Paper Award, USENIX Security 2008
Pwnie Award - Most Innovative Research, Black Hat 2008
National Science Foundation Graduate Research Fellowship, 2007–10
AT&T Labs Graduate Fellowship, 2005–07
Francis Lothrop Upton Fellowship, Princeton University, 2005
Ford Motor Company Scholarship, UC Berkeley, 2003–04
UC Berkeley EECS Honors Program
Eta Kappa Nu
Publications in Gabrielle De Micheli and Nadia Heninger. Survey: Recovering cryptographic keys from
Refereed partial information, by example, IACR Communications in Cryptology, vol. 1, no. 1,
Journals Apr 09, 2024.
Ted Chinburg, Brett Hemenway Talk, Nadia Heninger, and Zachary Scherr. Two variable
polynomial congruences and capacity theory. Mathematical Cryptology, 3(1), 11-28.
2023
Gabrielle De Micheli, Nadia Heninger, and Barak Shani. Characterizing overstretched
NTRU attacks. Journal of Mathematical Cryptology 14:110-119, June 2020.
Brett Hemenway Falk, Nadia Heninger, and Michael Rudow. Properties of Constacyclic
Codes Under the Schur Product. Designs, Codes, and Cryptography 88: 993–1021,
February 2020.
Stephen Checkoway, Jacob Maskiewicz, Christina Garman, Joshua Fried, Shaanan
Cohney, Matthew Green, Nadia Heninger, Ralf-Philipp Weinmann, Eric Rescorla, and
Hovav Shacham. Where did I leave my keys?: Lessons from the Juniper Dual EC
incident. Communications of the ACM 61(11):145–55, November 2018.
Fergus Dall, Gabrielle De Micheli, Thomas Eisenbarth, Daniel Genkin, Nadia Heninger,
Ahmad Moghimi, and Yuval Yarom. Cache Quote: Efficiently Recovering Long-Term
Secrets of SGX EPID. Transactions of Cryptographic Hardware and Embedded Systems
2018.
Yuval Yarom, Daniel Genkin, and Nadia Heninger. CacheBleed: A Timing Attack on
OpenSSL Constant Time RSA. Journal of Cryptographic Engineering (2017) p. 1–14,
2017.
Henry Cohn and Nadia Heninger. Ideal forms of Coppersmith’s theorem and Guruswami-
Sudan list decoding. Advances in Mathematics of Communications 9(3) p. 311-339,
July 2015.
Henry Cohn and Nadia Heninger. Approximate common divisors via lattices. Proceedings
of the Tenth Algorithmic Number Theory Symposium The Open Book Series 1(1) p.
271–293, November 2013.
J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul,
Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, and Edward W. Felten.
Lest we remember: Cold boot attacks on encryption keys. Communications of the
ACM 52(5):91–98, May 2009.
Nadia Heninger, Eric Rains and N. J. A. Sloane. On the integrality of n-th roots of
generating functions. Journal of Combinatorial Theory Series A 113(8) p. 1732–1745,
November 2006.
2 of 16
Refereed Hannah Davis, Matthew D. Green, Nadia Heninger, Keegan Ryan, and Adam Suhl. On
Conference the Possibility of a Backdoor in the Micali-Schnorr Generator. PKC 2024.
Proceedings
Keegan Ryan, Kaiwen He, George Arnold Sullivan, and Nadia Heninger. Passive SSH
key compromise via lattices. CCS 2023.
Keegan Ryan and Nadia Heninger. Fast Practical Lattice Reduction through Iterated
Compression. Crypto 2023. Best paper award.
Dylan Rowe, Joachim Breitner and Nadia Heninger. The curious case of the half-half
Bitcoin ECDSA nonces. Africacrypt 2023.
Keegan Ryan and Nadia Heninger. The Hidden Number Problem with Small Unknown
Multipliers: Cryptanalyzing MEGA in Six Queries and Other Applications. PKC
2023. Best paper award.
George Arnold Sullivan, Jackson Sippe, Nadia Heninger, and Eric Wustrow. Open to a
fault: On the passive compromise of TLS keys via transient errors. Usenix Security
2022.
Martin R. Albrecht and Nadia Heninger. On Bounded Distance Decoding with Predicate:
Breaking the “Lattice Barrier” for the Hidden Number Problem. Eurocrypt 2021.
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé,
and Paul Zimmermann. Comparing the difficulty of factorization and discrete loga-
rithm: a 240-digit experiment. Crypto 2020.
Daniel Moghimi, Jo Van Bulck, Nadia Heninger, Frank Piessens, and Berk Sunar. Copy-
Cat: Controlled Instruction-Level Attacks on Enclaves for Maximal Key Extraction.
Usenix Security 2020.
Daniel Moghimi, Berk Sunar, Thomas Eisenbarth, and Nadia Heninger. TPM-FAIL:
TPM meets Timing and Lattice Attacks. Usenix Security 2020
Shaanan Cohney, Andrew Kwong, Shachar Paz, Daniel Genkin, Nadia Heninger, Eyal
Ronen, and Yuval Yarom. Pseudorandom Black Swans: Cache Attacks on CTR DRBG.
2020 IEEE Symposium on Security and Privacy
Joachim Breitner and Nadia Heninger. Biased Nonce Sense: Lattice Attacks against
Weak ECDSA Signatures in Cryptocurrencies. Financial Cryptography 2019. St.
Kitts. February 18–22, 2019.
Marcella Hastings, Nadia Heninger, and Eric Wustrow. The Proof is in the Pudding:
Proofs of Work for Solving Discrete Logarithms. Financial Cryptography 2019. St.
Kitts. February 18–22, 2019.
Shaanan Cohney, Matthew D. Green, and Nadia Heninger. Practical state recovery
attacks against legacy RNG implementations. CCS 2018. Toronto, Canada. October
15–19, 2018.
Gabrielle De Micheli, Nadia Heninger, and Barak Shani. Characterizing overstretched
NTRU attacks. MathCrypt 2018. Santa Barbara, California. August 19, 2018.
Luke Valenta, Nadia Heninger, Antonio Sanso, Nick Sullivan. In search of CurveSwap:
Measuring elliptic curve implementations in the wild. 3rd IEEE European Symposium
on Security and Privacy London, UK. April 24–26, 2018.
Daniel J. Bernstein, Joachim Breitner, Daniel Genkin, Leon Groot Bruinderink, Nadia
Heninger, Tanja Lange, Christine van Vredendaal, and Yuval Yarom. Sliding right into
disaster: Left-to-right sliding windows leak. Conference on Cryptographic Hardware
and Embedded Systems 2017. Taipei, Taiwan. September 25–28, 2017.
3 of 16
Daniel J. Bernstein, Nadia Heninger, Paul Lou, and Luke Valenta. Post-Quantum
RSA. Eighth International Conference on Post-Quantum Cryptography. Utrecht,
Netherlands. June 26–28 2017.
Joshua Fried, Pierrick Gaudry, Nadia Heninger, and Emmanuel Thomé. A kilobit hidden
SNFS discrete logarithm computation. Eurocrypt 2017 Paris, France. June 1–3 2017.
Luke Valenta, David Adrian, Antonio Sanso, Shaanan Cohney, Joshua Fried, Marcella
Hastings, J. Alex Halderman, Nadia Heninger. Measuring small subgroup attacks
on Diffie-Hellman. Network and Distributed System Security Symposium San Diego,
California. February 27–March 1, 2017.
Ted Chinburg, Brett Hemenway, Nadia Heninger, and Zachary Scherr. Cryptographic
applications of capacity theory: On the optimality of Coppersmith’s method for
univariate polynomials. AsiaCrypt 2016. Hanoi, Vietnam, December 5–8 2016.
Marcella Hastings, Joshua Fried, Nadia Heninger. Weak keys remain widespread in
network devices. Internet Measurement Conference Santa Monica, CA, November
14–16 2016.
Yuval Yarom, Daniel Genkin, and Nadia Heninger. CacheBleed: A Timing Attack on
OpenSSL Constant Time RSA. Conference on Cryptographic Hardware and Embedded
Systems, Santa Barbara, California, August 17–19 2016.
Nimrod Aviram, Sebastian Schinzel, Juraj Somorovsky, Nadia Heninger, Maik Dankel,
Jens Steube, Luke Valenta, David Adrian, J. Alex Halderman, Viktor Dukhovni,
Emilia Käsper, Shaanan Cohney, Susanne Engels, Christof Paar, and Yuval Shavitt.
DROWN: Breaking TLS using SSLv2.25th Usenix Security Symposium, Austin, Texas
August 10–12 2016.
Luke Valenta, Shaanan Cohney, Alex Liao, Joshua Fried, Satya Bodduluri, and Na-
dia Heninger. Factoring as a Service. 20th International Conference on Financial
Cryptography and Data Security, Barbados February 22–26 2016.
David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew
Green, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke
Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella-Béguelin, and Paul
Zimmermann. Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. 22nd
ACM Conference on Computer and Communications Security, Denver, CO, October
12–15 2015. Best paper award.
Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig,
and Eric Wustrow. Elliptic Curve Cryptography in Practice. 18th International
Conference on Financial Cryptography and Data Security, Barbados March 3–7 2014.
Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger,
Tanja Lange, and Nicko van Someren. Factoring RSA keys from certified smart cards:
Coppersmith in the wild. AsiaCrypt 2013, Bangalore, India December 2–5 2013.
Deepika Gopal and Nadia Heninger. Torchestra: Reducing interactive traffic delays over
Tor. Workshop on Privacy in the Electronic Society, Raleigh, NC, October 15, 2012.
4 of 16
Nadia Heninger, Zakir Durumeric, Eric Wustrow, and J. Alex Halderman. Mining your
Ps and Qs: Detection of widespread weak keys in network devices. 21st USENIX
Security Symposium, Bellevue, WA August 8–10 2012. Best paper award.
Casey Devet, Ian Goldberg, and Nadia Heninger. Optimally robust private information
retrieval. 21st USENIX Security Symposium, Bellevue, WA August 8–10 2012.
Henry Cohn and Nadia Heninger. Approximate common divisors via lattices. Tenth
Algorithmic Number Theory Symposium, San Diego, CA July 9–13 2012.
Henry Cohn and Nadia Heninger. Ideal forms of Coppersmith’s theorem and Guruswami-
Sudan list decoding. 11p. Proceedings of Innovations in Computer Science 2011,
Beijing, China January 7–9 2011.
William Clarkson, Tim Weyrich, Adam Finkelstein, Nadia Heninger, J. Alex Halderman,
and Edward W. Felten. Fingerprinting blank paper using commodity scanners. 30th
IEEE Symposium on Security and Privacy, Oakland, CA, May 17–20 2009.
J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul,
Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, and Edward W. Felten.
Lest we remember: Cold boot attacks on encryption keys. 17th USENIX Security
Symposium, San Jose, CA, July 30–August 1 2008. Best student paper award.
Book Chapters “RSA, DH, and DSA in the Wild” in Joppe W. Bos and Martijn Stam (Eds.) Computa-
tional Cryptography: Algorithmic Aspects of Cryptography 2021.
Reports Cryptography and the Intelligence Community: The Future of Encryption. Steven B.
Lipner, Mark Lowenthal, Hans Rober Davies, Chip Elliott, Glenn S. Gerstell, Nadia
Heninger, Seny Kamara, Paul Carl Kocher, Brian LaMacchia, Butler W. Lampson,
Rafail Ostrovsky, Elizabeth Rindskopf Parker, Peter Swire, Peter J. Weinberger.
National Academies of Sciences, Engineering, and Medicine. 2022. Washington, DC:
The National Academies Press.
Other “Cold boot attacks” in van Tilborg, Henk C.A., Jajodia, Sushil (Eds.) Encyclopedia of
Cryptography and Security (2nd ed.) Springer. 2011.
5 of 16
NSF CAREER: Cryptographic Security at Internet Scale,
Awarded 7/2017
Cisco Equipment Gifts
Awarded 1/2016, 7/2016, and 7/2017
NSF TWC: Medium: Cryptographic Applications of Capacity Theory
Ted Chinburg, Brett Hemenway, Nadia Heninger, Awarded 10/2015
Amazon AWS Research Education Grant
Awarded 6/2015 and 10/2015
Cisco: Security Protocol Analysis Cluster Engineering
Nadia Heninger and Jonathan Smith,
Awarded 4/2015
Intel-NSF CPS: Synergy: Collaborative Research: Security and Privacy-Aware Cyber-
Physical Systems, Lee, Haeberlen, Hanson, Heninger, Koppel, Pajic, Pappas, Phan,
Sokolsky, Vagle, Yoo, Shin,
Awarded 5/2015
NSF TWC: Medium: Collaborative: Black-box evaluation of cryptographic entropy at
scale J. Alex Halderman, Nadia Heninger, Hovav Shacham,
Awarded 10/2014.
NSF Mathematical Sciences Postdoctoral Research Fellowship,
Awarded 7/2011.
6 of 16
Keynote Lecture, Selected Areas of Cryptography, Remote, August 2022
Algorithmic techniques and open problems in cryptanalysis
Keynote Lecture, International Symposium on Symbolic and Algebraic Computation,
Remote, July 2021
7 of 16
A kilobit hidden SNFS discrete logarithm calculation
Foundations of Computational Mathematics Number Theory Workshop, Barcelona,
Spain, July 2017
Oberwolfach, Germany, January 2017
Random number generation done wrong
Wr0ng Workshop, Paris, May 2017
How not to implement Diffie-Hellman
CrossFyre Workshop, Paris, May 2017
ETH Zurich security seminar, March 2017
8 of 16
Aarhus University theory seminar November 2012
UCSD cryptography seminar April 2012
UC Irvine cryptography seminar March 2012
Provably solving multivariate approximate common divisors via lattices
ICERM Workshop on Mathematics of Lattices and Cybersecurity, Brown University,
April 2015
Black-Box Cryptanalysis
ICERM Workshop on Mathematics of Cybersecurity, Brown University, October 2014
Approximate common divisors via lattices
Seminar, ENS Lyon, France, June 2014
Crypto Working Group seminar, Utrecht Netherlands, May 2014
Workshop on Lattice-Based Cryptography, Bangalore, India December 2013
Mathematical and Statistical Aspects of Cryptography, Calcutta, India January 2012
U Waterloo cryptography seminar December 2011
UC Irvine cryptography seminar November 2011
Ideal forms of Coppersmith’s theorem and Guruswami-Sudan list decoding/
Lattices in cryptanalysis and list-decoding of error-correcting codes
UPenn Mathematics Colloquium, February 2014
Invited lecture, Symbolic Computation and Cryptography (SCC 2012) Castro
Urdiales, Spain July 2012;
SIAM Conference on Applied Algebraic Geometry, Raleigh, NC, October 2011
AWM 40 Years and Counting Conference, Providence, RI, September 2011
TU Eindhoven, March 2011
UC San Diego, February 2011
AT&T Labs, May 2010
Theory reading group Microsoft/MIT, February 2010
Factoring made easy
Microsoft Research New England 5th Anniversary Celebration, Cambridge, MA,
October 2013
Tutorial on lattice-based cryptography
Dagstuhl Workshop on Quantum Cryptanalysis, Germany September 2013
Workshop on Post-Quantum Cryptography and Quantum Algorithms Leiden, Nether-
lands November 2012
Polynomial versions of Coppersmith’s Theorem
SIAM Conference on Applied Algebraic Geometry, Fort Collins, CO, August 2013
The state of factoring algorithms and other cryptanalytic threats to RSA
ISAT workshop keynote (with Daniel J. Bernstein and Tanja Lange) January 2013
Cryptanalysis and side-channel attacks
Pomona College CS colloquium, September 2011
Cold boot attacks against encryption keys
TU Eindhoven, March 2011
Guest lecture in graduate network security course, Boston University, October 2010
MIT security seminar, September 2010
NY Area Crypto Day, April 2010
Workshop on Provable Security against Physical Attacks Leiden, Netherlands, February
2010
Confidence 2.0 Warsaw, Poland November 2009
AT&T Labs Seminar, May 2008
9 of 16
IDA-CCR Princeton Seminar, May 2008
Reconstructing RSA private keys from random key bits
AT&T Labs Seminar, May 2009
UC San Diego Seminar, March 2009
University of Michigan Theory Seminar, March 2009
Lattices, lattice reduction, and computational problems in cryptanalysis and coding theory
Three-hour invited minicourse, Park City Mathematics Institute Graduate Summer
School, July 2022
How to recover cryptographic keys from partial information
Australian Summer School on Embedded Cryptography, Adelaide, Australia, December
2018
Introduction to public-key cryptography
Summer School on Real-World Crypto and Privacy, Sibenik, Croatia, June 2018
Factoring algorithms and lattice attacks against RSA
Three hours of lectures at the IACR Advanced School of Cryptography, Havana, Cuba,
September 2017
Factoring and discrete log algorithms
School on Security of Cryptographic Algorithms and Devices for Real-World Applica-
tions, Sibenik, Croatia, June 2015
Panels Recent trends in crypto with Dan Boneh, Steven Galbraith, Kristin Lauter, Mehdi
Tibouchi, Yuval Yarom, Elliptic Curve Cryptography Workshop, Remote, October
2020
Restoring Personal Privacy without Compromising National Security with Whit Diffie,
Bryan Ford, Paul Syverson, and Joan Feigenbaum, ACM Turing 50 Celebration, San
Francisco, May 2017
Cybersecurity: Mathematics and Policy with Susan Landau, Ron Rivest, and Alice
Silverberg, American Association for the Advancement of Science Annual Meeting,
Boston, February 2017
Theory x Practice Driven Cryptography: Future Challenges and Opportunities with
Jeroen van de Graaf and Marcos Simplicio, Brazil-USA Workshop on Cybersecurity
and Privacy on the Internet, Brasilia, Brazil, December 2015
10 of 16
PETs Post-Snowden: Implications of the revelations of the NSA and GCHQ Surveillance
Programs for the PETs community
with Wendy Seltzer, Marek Tuszynski, George Danezis, and Seda Gurses, PET
Symposium Amsterdam, Netherlands, July 2014
Advising Postdocs
Daniel Moghimi (co-advised with Deian Stefan) winter 2021–fall 2022
Barak Shani fall 2017–spring 2019
Daniel Genkin (co-advised with Jonathan Katz) fall 2016–summer 2018
PhD students
Miro Haller
Adam Suhl (co-advised with Daniele Micciancio)
Laura Shea (co-advised with Mihir Bellare)
Keegan Ryan (anticipated 2025)
George Sullivan (anticipated 2024)
Gabrielle De Micheli (Penn CIS, fall 2017–summer 2019)
Marcella Hastings (Penn CIS, spring 2021)
Shaanan Cohney (Penn CIS, fall 2019),
Luke Valenta (Penn CIS, spring 2019)
11 of 16
PhD committees
Alexander Mathers, (Math, UCSD)
Jack Garzella (Math, UCSD)
Ariana Mirian (CSE, UCSD, April 2023)
John Renner (CSE, UCSD, August 2022)
Akira Takahashi (Aarhus University, June 2022)
Vitto Giuseppe (University of Luxembourg, January 2022)
Wei Dai (CSE, UCSD, November 2021)
Sunjay Cauligi (CSE, UCSD, August 2021)
Joost Renes, (CS, Radboud University, Netherlands, July 2019)
Laurent Grémy (CS, Université de Lorraine, France, September 2017)
Christina Garman (CS, Johns Hopkins, August 2017)
Vincent Neiger (Math, ENS de Lyon, France, November 2016)
Sandy Clark (CIS, University of Pennsylvania, October 2016)
Cyril Bouvier (Math, Université de Lorraine, France, July 2015)
Edvard Fagerholm (Math, University of Pennsylvania, April 2015)
Dong Lin (CIS, University of Pennsylvania, March 2015)
12 of 16
David Min, (UCSD spring 2023)
Kaiwen He, (UCSD summer 2022–spring 2023)
Annie Dai, (UCSD winter 2022–spring 2023)
Dustin Lin, (UCSD winter–summer 2022)
Laurence D’ercole, Jessica Lam, Issac Navarro, Britney Vi ERSP Scholars fall 2020–
spring 2021
Kunlin Cai (Summer 2020, visiting from BU)
Robert Jiang (UCSD Regents Scholars Research Initiative Fall 2020)
Paul Lou (Fall 2018, Summer 2018, CIS 400 2017–2018, Rachleff scholar summer 2016)
Lauren Leung (Independent study fall 2017)
Henry Zhu (PURM undergraduate researcher, summer 2017)
Jeff Barg and Ajay Patel (CIS 400, spring 2017)
Tom Yurek (Research assistant summer 2016, visiting from Purdue)
Joseph Cappadona (Research assistant summer 2016)
Terry Sun (Independent study spring 2015, spring 2016, RA summer 2016)
Richard Roberts (Independent study spring 2015, spring 2016)
Michael Rudow (Independent study spring 2016, fall 2016)
Sudarshan Muralidhar, Doron Shapiro, Michelle Socher (CIS 400, fall 2015–spring
2016, 1st place in department competition)
Justin MacIntosh and Richard Roberts (CIS 400, fall 2015–spring 2016, 3rd place in
department competition)
Alex Liao (Research assistant summer 2015)
Joseph Ooi (EAS 499, spring 2015)
Darren Yin (Independent study spring 2015)
Jerry Guo (EAS 499, spring 2014)
Starry Peng (EAS 499, fall 2013)
Program committees
2025 Arcticrypt
2023 Real World Crypto
2022 Crypto
2022 Real World Crypto
2021 Usenix Security Symposium
2021 Real World Crypto
2020 Real World Crypto
2019 Real World Crypto
13 of 16
2018 Usenix Security Symposium
2018 IEEE Security and Privacy
2018 Real World Crypto
2017 Usenix Security Symposium
2017 Crypto
2016 Usenix Security Symposium
2016 ArticCrypt
2016 IEEE Security and Privacy
2016 Privacy Enhancing Technologies Symposium (PETS)
2015 Usenix Security Symposium
2015 IEEE Security and Privacy
2015 Financial Cryptography
2014 Usenix Security Symposium
2014 Crypto
2014 Award for Outstanding Research in Privacy-Enhancing Technologies
2014 Workshop on the Economics of Information Security (WEIS)
2014 International Conference on Post-Quantum Cryptography (PQCrypto)
2014 LatinCrypt
2014 Conference on Public Key Cryptography (PKC)
2011 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections
(EVT/WoTE)
Funding Review Panels
2023 NSF SaTC review panel
2021 NSF SaTC review panel
2020 NSF CI Fellows reviewer
2019 NSF SaTC review panel
2018 NSF SaTC review panel
Open Technology Fund Advisory Council 2014–2018
2014 NSF SaTC review panel
External reviewing
Eurocrypt 2024, Crypto 2020, CCS 2017, ANTS 2016, Crypto 2015, Asiacrypt 2013,
CCS 2013, SAC 2013, Crypto 2013, Asiacrypt 2012, PKC 2012, Journal of Cryptog-
raphy, Designs, Codes, and Cryptography, Financial Cryptography 2012, Journal of
Cryptographic Engineering, CT-RSA 2012, SODA 2012, Oakland 2011, TCC 2011,
Indocrypt 2010, CCS 2010, EVT/WOTE 2010, Crypto 2010, SAC 2009, CCS 2009
Outreach
“Fun with Cryptography” presentation for Girl Scouts at Penn Cryptography Workshop,
December 2017
“Picking Research Problems” panelist with Franzi Roesner at GREPSEC, May 2017
“Perception and (un)equal opportunities for women” panelist at CrossFyre Workshop,
May 2017
Organizing committee, GREPSEC 2017
“So You Want to Hack The Planet: Demystifying Careers and Opportunities in
Cryptography, Security & Privacy” panelist at Grace Hopper, October 2016
“Choosing the right research direction” panelist with Susan Landau, GREPSEC
Workshop for women and underrepresented women in security, San Jose, CA, May
2015
Presented at Mini Women in CS HS Day, November 2014
Presented at Camp Women in CS, UPenn, March 2014
Team leader, OurCS Workshop for Undergraduate Women in CS, CMU, October 2013
Team leader, OurCS Workshop for Undergraduate Women in CS, CMU, March 2011
14 of 16
Mentor for Summer Programming Experience program for undergraduates, Princeton
University, Summer 2009
University Speaking
“Weak cryptographic signatures in cryptocurrencies”, UCSD CNS Research Review,
October 2019
Research overview presentation, Penn CIS PhD student open house, March 2018
Research overview presentation, Penn CIS PhD student open house, March 2016
Research overview presentation, Penn PhD student open house, November 2015
Presented on “Information Security, Privacy, and Data Integrity” at Responsible
Conduct of Research workshop, Penn, April 2015
Panelist for “Studying for the PhD event” in Penn CIS, February 2015
Speaker for Penn Center for Teaching and Learning workshop, September 2014
“Cryptography, security, and you” Philomathean Society, Penn, April 2014
Department Seminars
Penn CS theory seminar Fall 2013–Spring 2014
Other Policy
“Chilling effects of the DMCA on security research” Congressional briefing with
Matthew Green, Jen Ellis, Dan Nabel, Jonathan Band, Washington DC, May 2015
2015 DMCA Exemption Submission for Software-Security Research, with Matt Blaze,
J. Alex Halderman, Ed Felten, and Steve Bellovin
Popularization
“LatticeHacks” presentation at 34C3 with Daniel J. Bernstein and Tanja Lange, Leipzig,
Germany, December 2017
“Logjam: Diffie-Hellman, discrete logs, the NSA, and you” presentation at 32C3 with
J. Alex Halderman, Hamburg, Germany, December 2015
“How is NSA breaking so much crypto?” blog post with J. Alex Halderman, Freedom
to Tinker, October 2015
“Crypto Tales from the Trenches” Organized panel with Julia Angwin, Laura Poitras,
and Jack Gillum at 31C3, Hamburg, Germany, December 2014
“The year in crypto” presentation at 30C3 with Daniel J. Bernstein and Tanja Lange
Hamburg, Germany December 2013
“Tales from the crypto community” with J. Alex Halderman Foreign Affairs online
October 23, 2013.
“RSA factorization in the real world” presentation at 29C3 with Daniel J. Bernstein
and Tanja Lange Hamburg, Germany December 2012
“New research: There’s no need to panic over factorable keys–just mind your Ps and
Qs” blog post at Freedom to Tinker, February 2012
Selected Media Coverage
“Celebrated Cryptography Algorithm Gets an Upgrade”
Quanta Magazine 12/2023 (Reprinted in Wired)
“In a first, cryptographic keys protecting SSH connections stolen in new attack”
Ars Technica 11/23
“Why quantum computers might not break cryptography”
Quanta Magazine 5/2017
“Des nombres truqués pour mieux espionner”
Le Monde 10/2016
“Drown attack: How weakened encryption jeopardizes ‘secure’ sites”
The Guardian 3/2016
“Breaking 512-bit RSA with Amazon EC2 is a cinch. So why all the weak keys?”
Ars Technica 10/2015
15 of 16
“Could a simple mistake be how the NSA was able to crack so much encryption?”
The Guardian 10/2015
“New Computer Bug Exposes Broad Security Flaws”
Wall Street Journal 5/2015
“LogJam: Sicherheitslücke bei verschlüsselten Verbindungen - so schützen Sie sich”
Der Spiegel 5/2015
“FREAK flaw undermines security for Apple and Google users, researchers discover”
Washington Post 3/2015
“Fatal crypto flaw in some government-certified smartcards makes forgery a snap”
Ars Technica 9/2013
“Crypto shocker: four of every 1,000 public keys provide no security”
Ars Technica 2/2012
“Researchers Find Way to Steal Encrypted Data”
NY Times 2/2008
Misc US Citizen
16 of 16