Emily Stamm

Emily StammEmily StammEmily Stamm

Emily Stamm

Emily StammEmily StammEmily Stamm
  • Home
  • About
  • Talks
  • Papers
  • Contact
  • Blog
  • Resources
    • Cryptography
    • Quantum Computing
  • More
    • Home
    • About
    • Talks
    • Papers
    • Contact
    • Blog
    • Resources
      • Cryptography
      • Quantum Computing
  • Home
  • About
  • Talks
  • Papers
  • Contact
  • Blog
  • Resources
    • Cryptography
    • Quantum Computing

Talks

 Please reach out to me about paid speaking engagements. See below for a sample of past presentations and a list of presentations and panels.  Talks with the Github link include live demos.

Contact Me

Past Public Speaking

Past PUBLIC SPEAKING - Presentations and PAnels

CONTRIBUTED TALKS

✦  CSNP Webinar “Post-Quantum Cryptography” (Webinar - 2022)   

✦  DefCon Crypto and Privacy Village “Online Voting: Theory and Practice” (Webinar - 2020)   

✦  Boston CyberSecurity Event on Cryptography “Elliptic Curves in Cryptography” (Boston, MA - 2020)   

✦  Chicago CyberSecurity Event on Cryptography “Post-Quantum Cryptography” (Chicago, IL - 2020)   

✦  Analytic and Combinatorial Number Theory: The Legacy of Ramanujan “An Investigation of (Nearly) Weakly Primes and Sieve Methods” (Urbana, IL - 2019)   

✦  Boston CyberSecurity Event on Real-World Encryption “RSA Cryptosystem” (Boston, MA - 2019)   

✦  ForenSecure “Post-Quantum Cryptography: A Survey” (Wheaton, IL - 2019)   

✦  Joint Mathematics Meetings “Lacunary Eta-quotients modulo powers of primes” (San Diego, CA - 2018)   

✦  Southeastern Undergraduate Mathematics Conference “Lacunary Eta-quotients modulo powers of primes” (Atlanta, GA - 2017)   

✦  Joint Mathematics Meetings “When is a^n+1 the sum of two squares?” (Atlanta, GA - 2017)   

✦  UGA Mock AMS Conference “When is a^n+1 the sum of two squares?” (Athens, GA - 2016) 

Sample Presentations

Post-Quantum Cryptography

Post-Quantum Cryptography

Post-Quantum Cryptography

We explain the effect of quantum computers on public key cryptography. We describe the mathematics of  post-quantum cryptography, including lattice-based, code-based, multivariate, isogeny-based cryptography.  ADVANCED

RSA Cryptosystem

Post-Quantum Cryptography

Post-Quantum Cryptography

RSA is the most widely used public key cryptography algorithm, from encryption in HTTPS to digital signatures. We describe RSA encryption and digital signatures algorithms. We demonstrate the Bleichenbacher Million Message attack on RSA and explain how to prevent this attack.  We describe the effect of quantum computers on RSA. INTERMEDIATE

Github

Elliptic Curves in Cryptography

Elliptic Curves in Cryptography

Elliptic Curves in Cryptography

An elliptic curve is a type of mathematical curve on a plane. We describe what an elliptic curve is and why it is important in public key cryptography. We explain the classical elliptic curve cryptography (ECC) that is widely used today, as well as the modern post-quantum isogeny-based cryptography. ADVANCED

Quantum Game Theory

Elliptic Curves in Cryptography

Elliptic Curves in Cryptography

Quantum computing is a new form of computing based on quantum mechanics rather than classical mechanics. Quantum game theory is an emerging field in which quantum algorithms are used to find new solutions to game theory problems. We  demonstrate several games using a Quantum Virtual Machine including a Coin Flip game and the Prisoner’s Dilemma. ADVANCED

Github

Lattice Cryptography

Lattice Cryptography

Lattice Cryptography

Lattice-based cryptography is the most popular form of post-quantum cryptography and the mathematics and design also accommodates encryption, signatures, hash functions, and newer modern cryptographic protocols like identity-based encryption, homomorphic encryption, and functional encryption. In particular, lattice schemes are the only known mathematics currently that allow secure and practical fully homomorphic encryption. ADVANCED 

AES Cryptosystem

Lattice Cryptography

Lattice Cryptography

Advanced Encryption Standard (AES) is one of the most widely used cryptographic algorithms. We provide an overview of the algorithm, modes of operation, implementations, and security of AES. We demonstrate a simple attack on the AES-ECB mode, and discuss available secure AES modes and implementations.  INTERMEDIATE

Github

Connect With Us

Copyright © 2024 Emily Stamm - All Rights Reserved.

  • About
  • Talks
  • Papers
  • Contact
  • Blog