Quantum circuits for the CSIDH : optimizing quantum evaluation of isogenies
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 220022452
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-030-17656-3_15
- Title of conference / published proceedings
- Advances in Cryptology - EUROCRYPT 2019
- First page
- 409
- Volume
- -
- Issue
- -
- ISSN
- 1611-3349
- Open access status
- Deposit exception
- Month of publication
- April
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
B - Cybersecurity and Cryptography
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper performed a careful and necessary cryptanalysis for the fastest known quantum algorithm to attack the post-quantum candidate CSIDH. It is the only paper computing the precise complexity of evaluating an oracle call during Kuperberg's algorithm, which is a necessary computation to analyze the security of CSIDH. The techniques in this paper give optimizations both on the quantum attack and on the constant time implementation, and have also been used to move towards a secure and efficient implementation on embedded devices (see https://link.springer.com/chapter/10.1007/978-3-030-16350-1_12), which is necessary for CSIDH to be integrated into industry.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -