Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Submitting institution
-
The University of Surrey
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9026475_1
- Type
- D - Journal article
- DOI
-
10.1007/978-3-662-44381-1_8
- Title of journal
- Advances in Cryptology – CRYPTO 2014;Lecture Notes in Computer Science
- Article number
- -
- First page
- 126
- Volume
- 0
- Issue
- 0
- ISSN
- 0302-9743
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2014
- 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
-
-
- Research group(s)
-
-
- Citation count
- 32
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work demonstrated the vulnerability of two cryptographic schemes which were designed to be 128-bit secure – the industry standard – when subjected to recent breakthrough discrete logarithm techniques and several new optimisations. It is significant because although new records had recently been set for such computations, the schemes proposed in the literature are much harder to solve; the total break of one and estimated weakness of the other proved that such schemes should be deprecated. Results were featured in The Register (https://www.theregister.co.uk/2014/05/26/boffins_splat_supersingular_curve_crypto/), phys.org (https://phys.org/news/2014-05-unassailable-encryption-algorithm-hours.html) among other outlets, and Granger was interviewed on World Radio Switzerland to discuss their impact.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -