Video URL

https://simons.berkeley.edu/talks/overview-attacks-elliptic-curve-isogenies-based-systems-0

Overview of Attacks on Elliptic Curve Isogenies Based Systems

(2020). Overview of Attacks on Elliptic Curve Isogenies Based Systems. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/overview-attacks-elliptic-curve-isogenies-based-systems-0

Overview of Attacks on Elliptic Curve Isogenies Based Systems. The Simons Institute for the Theory of Computing, Feb. 24, 2020, https://simons.berkeley.edu/talks/overview-attacks-elliptic-curve-isogenies-based-systems-0 

          @misc{ scivideos_15466,
            doi = {},
            url = {https://simons.berkeley.edu/talks/overview-attacks-elliptic-curve-isogenies-based-systems-0},
            author = {},
            keywords = {},
            language = {en},
            title = { Overview of Attacks on Elliptic Curve Isogenies Based Systems},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {feb},
            note = {15466 see, \url{https://scivideos.org/Simons-Institute/15466}}
          }
Chloe Martindale, University of Bristol
Source Repository Simons Institute
Subject

Abstract

We will focus on the open questions surrounding applying Kuperberg's quantum algorithm to solve the Dihedral Hidden Subgroup Problem to CSIDH. We will recap results on understanding the asymptotic complexity of an oracle call, and of the number of queries needed, and then look at some work on concrete complexities for specific instances. We will focus on joint work with Bernstein, Lange, Panny, and myself on computing the exact complexity of one oracle call, and give a list of open questions to be studied in order to get an approximation for secure parameters (according to the definitions given by NIST).