Name
Abstract | ||
|---|---|---|
In the third round of the NIST PQC standardization process, the only isogeny-based candidate, SIKE, suffers from slow performance when compared to other contenders. The large-degree isogeny computation performs a series of isogenous mappings between curves, to account for about 80% of SIKE's latency. Here, we propose, implement, and evaluate a new method for computing large-degree isogenies of an odd power. Our new strategy for this computation avoids expensive recomputation of temporary isogeny results. We modified open-source libraries targeting x86, ARM64, and ARM32 platforms. Across each of these implementations, our new method achieves 10% and 5% speedups in SIKE's key encapsulation and decapsulation operations, respectively. Additionally, these implementations use 3% less stack space at only a 48 byte increase in code size. Given the benefit and simplicity of our approach, we recommend this method for current and emerging SIKE implementations. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/978-3-030-95312-6_3 | TOPICS IN CRYPTOLOGY, CT-RSA 2022 |
Keywords | DocType | Volume |
Isogeny-based cryptography, Post-quantum cryptography, SIKE, Isogeny computations | Conference | 13161 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rami Elkhatib | 1 | 6 | 1.81 |
| Brian Koziel | 2 | 0 | 0.68 |
| Reza Azarderakhsh | 3 | 0 | 0.68 |