Efficient Compression of SIDH Public Keys

DOI10.1007/978-3-319-56620-7_24zbMath1420.94054OpenAlexW2573560101MaRDI QIDQ5738894

David Urbanik, Joost Renes, Michael Naehrig, Patrick Longa, David D. W. Yao, Craig Costello

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56620-7_24

zbMATH Keywords

isogeniessupersingular elliptic curvespost-quantum cryptographyDiffie-Hellman key exchangeSIDHpublic-key compressionPohlig-Hellman algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (18)

Resistance of isogeny-based cryptographic implementations to a fault attack ⋮ Faster isogenies for post-quantum cryptography: SIKE ⋮ An efficient post-quantum KEM from CSIDH ⋮ Supersingular curves you can trust ⋮ SCALLOP: scaling the CSI-FiSh ⋮ SQISign: compact post-quantum signatures from quaternions and isogenies ⋮ B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion ⋮ Oblivious pseudorandom functions from isogenies ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ On the cost of computing isogenies between supersingular elliptic curves ⋮ How not to create an isogeny-based PAKE ⋮ Post-quantum static-static key agreement using multiple protocol instances ⋮ Side-channel attacks on quantum-resistant supersingular isogeny Diffie-Hellman ⋮ Computational problems in supersingular elliptic curve isogenies ⋮ Isogeny-based key compression without pairings ⋮ Eliptic curves in post-quantum cryptography ⋮ Quantum permutation pad for universal quantum-safe cryptography ⋮ Memory optimization techniques for computing discrete logarithms in compressed SIKE

Uses Software

• McEliece
• SIDH
• Elligator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• The Weil pairing, and its efficient calculation
• Efficient pairing computation on supersingular abelian varieties
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Lattice Cryptography for the Internet
• On the Security of Supersingular Isogeny Cryptosystems
• Structure computation and discrete logarithms in finite abelian $p$-groups
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• The Eta Pairing Revisited
• Pairing Lattices
• The Arithmetic of Elliptic Curves
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The Montgomery inverse and its applications
• Elliptic Curves
• How to do a 𝑝-descent on an elliptic curve
• Secure integration of asymmetric and symmetric encryption schemes
• Advances in Cryptology - CRYPTO 2003
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Efficient Compression of SIDH Public Keys