Paper 2022/1464
Parallel Isogeny Path Finding with Limited Memory
Abstract
The security guarantees of most isogeny-based protocols rely on the computational hardness of finding an isogeny between two supersingular isogenous curves defined over a prime field
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Published elsewhere. INDOCRYPT 2022
- Keywords
- isogenies cryptanalysis GPU golden collision search meet-in-the-middle time-memory trade-offs implementation
- Contact author(s)
-
emanuele bellini @ tii ae
jorge saab @ tii ae
jesus dominguez @ tii ae
andre esser @ tii ae
sorina ionica @ u-picardie fr
luis zamarripa @ tii ae
francisco rodriguez @ tii ae
monika trimoska @ ru nl
floyd zweydinger @ rub de - History
- 2022-10-26: approved
- 2022-10-26: received
- See all versions
- Short URL
- https://ia.cr/2022/1464
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1464, author = {Emanuele Bellini and Jorge Chavez-Saab and Jesús-Javier Chi-Domínguez and Andre Esser and Sorina Ionica and Luis Rivera-Zamarripa and Francisco Rodríguez-Henríquez and Monika Trimoska and Floyd Zweydinger}, title = {Parallel Isogeny Path Finding with Limited Memory}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1464}, year = {2022}, url = {https://eprint.iacr.org/2022/1464} }