Faster Key Compression for Isogeny-Based Cryptosystems
From MaRDI portal
Publication:5228936
DOI10.1109/TC.2018.2878829zbMATH Open1420.94100OpenAlexW2901241775MaRDI QIDQ5228936FDOQ5228936
Authors: Gustavo H. M. Zanon, Marcos A. jun. Simplício, Geovandro C. C. F. Pereira, Javad Doliskani, Paulo S. L. M. Barreto
Publication date: 13 August 2019
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2018.2878829
Cited In (6)
- Memory optimization techniques for computing discrete logarithms in compressed SIKE
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- LOVE a pairing
- Isogeny-based key compression without pairings
- Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees
- A polynomial time attack on instances of M-SIDH and FESTA
This page was built for publication: Faster Key Compression for Isogeny-Based Cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228936)