Past Seminars- Cryptography

Printer-friendly version
  • Travis Scholl
    Tue Oct 9, 2018
    3:00 pm
    Elliptic curve cryptography (ECC) is a widely used public key cryptosystem. The security of ECC relies on the difficulty of the elliptic curve discrete log problem (ECDLP). Isogenies are morphisms of curves that can be used to transfer instances of ECDLP between elliptic curves. Suppose that we suspect that some proportion of curves are...
  • Josh Benaloh, Alex Halderman, Hovav Shacham
    Tue Mar 13, 2018
    3:30 pm
    Event on Elections and Voting, with Panels on the Technology, Law, & Policy of Election Hacking, 1:30 - 7:30 pm The Technology of Voting: Risks & Opportunities Josh Benaloh (Microsoft Research) Alex Halderman (University of Michigan) Hovav Shacham (UC San Diego) Panel moderated by Alice Silverberg (UC Irvine), 3:30 pm - 4:40 pm Keynote...
  • TBA
    Tue May 30, 2017
    2:00 pm
  • Alice Silverberg and Shahed Sharif
    Tue May 30, 2017
    2:00 pm
    A.S. will give some remarks (joint work with Hendrik Lenstra) on homomorphic encryption schemes of Smart-Vercauteren and Gentry-Halevi. S.S. will discuss the paper "A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and Graded Encoding Schemes" by Martin Albrecht, Shi Bai, Léo Ducas,...
  • Shahed Sharif
    Mon May 22, 2017
    3:00 pm
    We will complete our discussion of the quantum algorithm to compute the unit group of a number field. We will then discuss applications by Biasse and Song to compute class groups and generators of principal ideals. The paper of Biasse and Song is available on my webpage, http://public.csusm.edu/ssharif/crypto
  • Shahed Sharif
    Mon May 15, 2017
    3:00 pm
    We will discuss the quantum Fourier transform for an arbitrary finite abelian group, and Hallgren's adaptation of Shor's algorithm to uncountable abelian groups—namely, to $\mathbb{R}$. Both pieces are essential ingredients in the quantum algorithm of Eisentr\"ager-Hallgren-Kitaev-Song to compute the unit group of a number field...
  • Shahed Sharif
    Mon May 8, 2017
    3:00 pm
    We will complete our discussion of Shor's algorithm for factoring integers. Then we will begin discussing Hallgren's quantum polynomial-time algorithm for solving Pell's equation x^2 - dy^2 = 1. The paper can be found at http://public.csusm.edu/ssharif/crypto/ Hallgren's idea is to adapt Shor's algorithm to estimate the...