Cryptography Primer Session 4 Primes, Elliptic Curves, & Lattices


May 7, 2014


Josh Benaloh




This will be the fourth of six cryptography primer sessions exploring the basics of modern cryptography. In this session, we’ll explore primality testing, elliptic curve cryptosystems, and lattice-based cryptosystems. Subsequent sessions (on alternating Fridays) are expected to include the following topics. Depending on the interests of the participants, other topics may be included or substituted. Attacks, vulnerabilities, and practical considerations Applications including zero-knowledge, secret sharing, homomorphic encryption, and election protocols.


Josh Benaloh

Josh Benaloh is Senior Cryptographer at Microsoft Research. He earned his S.B. degree at M.I.T. and M.S., M. Phil., and Ph.D. degrees at Yale University where his doctoral dissertation Verifiable Secret-Ballot Elections made the first substantive use of homomorphic encryption techniques and introduced a new paradigm for achieving election integrity. Josh serves as an elected director of the International Association for Cryptologic Research and an editor of the Journal of Election Technologies and Systems. He also serves on Microsoft’s Crypto Board and its PKI Working Group and in his copious spare time serves as Chair of Sound Transit’s Citizen Oversight Panel.