Isogeny-based key compression without pairings

DOI10.1007/978-3-030-75245-3_6OpenAlexW3167611694MaRDI QIDQ2061915

Geovandro C. C. F. Pereira, Paulo S. L. M. Barreto

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_6

Mathematics Subject Classification ID

Cryptography (94A60) Theory of data (68Pxx)

Related Items (2)

Faster isogenies for post-quantum cryptography: SIKE ⋮ Memory optimization techniques for computing discrete logarithms in compressed SIKE

Cites Work

• Unnamed Item
• Unnamed Item
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• The Pohlig-Hellman method generalized for group structure computation
• Faster isogeny-based compressed key agreement
• Dual isogenies and their application to public-key compression for isogeny-based cryptography
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Structure computation and discrete logarithms in finite abelian $p$-groups
• Twisted Edwards Curves
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Easy Decision Diffie-Hellman Groups
• Faster Key Compression for Isogeny-Based Cryptosystems
• Efficient Compression of SIDH Public Keys

This page was built for publication: Isogeny-based key compression without pairings