Memory optimization techniques for computing discrete logarithms in compressed SIKE

DOI10.1007/978-3-030-81293-5_16zbMATH Open1485.94093OpenAlexW3158353526MaRDI QIDQ2118550FDOQ2118550

Authors Aaron Hutchinson, Koray Karabina, Geovandro C. C. F. Pereira

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-81293-5_16

zbMATH Keywords

discrete logarithmsisogeny-based cryptographySIKEpublic key compression

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Dual isogenies and their application to public-key compression for isogeny-based cryptography
• Efficient compression of SIDH public keys
• Faster isogenies for post-quantum cryptography: SIKE
• Isogeny-based key compression without pairings
• Faster isogeny-based compressed key agreement

Cites work

• scientific article; zbMATH DE number 7385899 (Why is no real title available?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Compression in Finite Fields and Torus-Based Cryptography
• Dual isogenies and their application to public-key compression for isogeny-based cryptography
• Efficient compression of SIDH public keys
• Faster Key Compression for Isogeny-Based Cryptosystems
• Faster isogeny-based compressed key agreement
• Isogeny-based key compression without pairings
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(2)

• Isogeny-based key compression without pairings
• Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees

Describes a project that uses

Uses Software

• GitHub
• SIKE

This page was built for publication: Memory optimization techniques for computing discrete logarithms in compressed SIKE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118550)