Identification protocols and signature schemes based on supersingular isogeny problems
- Submitting institution
-
The University of Birmingham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 50013740
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-70694-8_1
- Title of conference / published proceedings
- Advances in Cryptology – ASIACRYPT 2017 : 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I
- First page
- 3
- Volume
- 10624
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Not compliant
- Month of publication
- November
- Year of publication
- 2017
- 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
-
2
- Research group(s)
-
-
- Citation count
- 26
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Isogeny problems are among the few hard problem candidates currently considered for building post-quantum cryptography. This paper presents the first signature scheme based on isogeny problems. The security is rigorously proved based on classical problems in computer algebra. It is significant as most of our current security infrastructures will become insecure once quantum computers are built.
The paper was given the best paper award at Asiacrypt 2017 conference, a top 3 cryptography conference. An extended version was invited to Journal of Cryptology. This paper formed input to a grant proposal that was ranked top by the EPSRC prioritisation panel (gow.epsrc.ac.uk/NGBOViewPanelROL.aspx?PanelId=1-5LF3MA&RankingListId=1-5LF3NI).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -