Faculty

George Noid, Indiana University

Michal Bajcsy, Stanford University

Adam Paetznick, IQC

Dr. Rainer Steinwandt, Florida Atlantic University

Abstract

Subgroups of elliptic curves over binary fields are a popular mathematical platform to implement cryptographic primitives and protocols. Using Shor's algorithm to tackle the discrete logarithm problem in such groups leads to the question of efficiently implementing the underlying group arithmetic on a quantum computer.

Ashley Montanaro, University of Cambridge

David Gosset, Institute for Quantum Computing (IQC)

Julio Barreiro, Max Planck Institute of Quantum Optics & Ludwig Maximilian University of Munich, Germany

Tobias Moroder, Universität Siegen