Abstract | ||
---|---|---|
The Couveignes-Rostovtsev-Stolbunov key-exchange protocol based on isogenies of elliptic curves is of interest because it may resist quantum attacks, but its efficient implementation remains a challenge. We briefly present the computations involved, and efficient algorithms to achieve the critical steps, with timing results for our implementations in Sage and Julia/Nemo.
|
Year | DOI | Venue |
---|---|---|
2018 | 10.1145/3338637.3338643 | ACM Communications in Computer Algebra |
Field | DocType | Volume |
Discrete mathematics,Isogeny,Cryptography,Mathematics | Journal | 52 |
Issue | ISSN | Citations |
4 | 1932-2240 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jean-claude Kieffer | 1 | 5 | 2.13 |
Luca De Feo | 2 | 62 | 7.36 |