Supersingular isogeny graphs and endomorphism rings : reductions and solutions
- Submitting institution
-
The University of Birmingham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 50018478
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-78372-7_11
- Title of conference / published proceedings
- Advances in Cryptology – EUROCRYPT 2018 : 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III
- First page
- 329
- Volume
- 10822
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- March
- Year of publication
- 2018
- 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
-
4
- Research group(s)
-
-
- Citation count
- 11
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Isogeny-based cryptography is a new promising approach to construct cryptographic protocols that will remain secure once quantum computers are built. This paper clarifies relations between some major computational problems in this area. It also connects them to long-standing problems in computer algebra, and it provides a partial attack on a cryptographic hash function based on isogenies. The paper was published at Eurocrypt 2018 conference, a top 2 conference in cryptography. I was invited to present this work at the ECC2018 conference, the flagship invitation-only conference related to elliptic curve cryptography (declined as my son was due around that time).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
