Name
Abstract | ||
|---|---|---|
New primes were proposed for Supersingular Isogeny Key Encapsulation (SIKE) in NIST standardization process of Round 2 after further cryptanalysis research showed that the security levels of the initial primes chosen were overestimated [1], [2]. In this paper, we develop a highly optimized E
<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub>
Montgomery multiplication algorithm and architecture that further utilizes the special form of SIKE prime compared to previous implementations available in the literature. We then implement SIKE for all Round 2 NIST security levels (SIKEp434 for NIST security level 1, SIKEp503 for NIST security level 2, SIKEp610 for NIST security level 3, and SIKEp751 for NIST security level 5) on Xilinx Virtex 7 using the proposed multiplier. Our best implementation (NIST security level 1) runs 29% faster and occupies 30% less hardware resources in comparison to the leading counterpart available in the literature [3] and implementations for other security levels achieved similar improvement. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ARITH48897.2020.00018 | 2020 IEEE 27th Symposium on Computer Arithmetic (ARITH) |
Keywords | DocType | ISSN |
hardware architectures,isogeny-based cryptography,Montgomery multiplication,post-quantum cryptography,SIKE | Conference | 1063-6889 |
ISBN | Citations | PageRank |
978-1-7281-7121-0 | 0 | 0.34 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rami Elkhatib | 1 | 6 | 1.81 |
| Reza Azarderakhsh | 2 | 389 | 45.65 |
| Mehran Mozaffari Kermani | 3 | 269 | 29.49 |