Effective pairings in isogeny-based cryptography
From MaRDI portal
Publication:6619926
DOI10.1007/978-3-031-44469-2_6zbMATH Open1547.94411MaRDI QIDQ6619926
Publication date: 16 October 2024
Cites Work
- Unnamed Item
- Unnamed Item
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
- Computing pairings using \(x\)-coordinates only
- On division polynomial PIT and supersingularity
- CSIDH: an efficient post-quantum commutative group action
- A faster way to the CSIDH
- Efficient implementation of pairing-based cryptosystems
- The Weil pairing, and its efficient calculation
- Optimal strategies for CSIDH
- (Short paper) Analysis of a strong fault attack on static/ephemeral CSIDH
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- Stronger and faster side-channel protections for CSIDH
- On Lions and elligators: an efficient constant-time implementation of CSIDH
- SQISign: compact post-quantum signatures from quaternions and isogenies
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- A Survey of Local and Global Pairings on Elliptic Curves and Abelian Varieties
- Efficient Pairing Computation with Theta Functions
- Optimal Pairings
- Identifying supersingular elliptic curves
- Advances in Cryptology – CRYPTO 2004
- The Tate Pairing Via Elliptic Nets
- Efficient Compression of SIDH Public Keys
- Disorientation faults in CSIDH
Related Items (1)
This page was built for publication: Effective pairings in isogeny-based cryptography