Efficient Compression of SIDH Public Keys
type: Item
instance of: scholarly article
title: Efficient Compression of SIDH Public Keys
zbMATH Open document ID: 1420.94054
DOI: 10.1007/978-3-319-56620-7_24
author: Craig Costello
author: David D. Yao
author: Patrick Longa
author: Michael Naehrig
author: Joost Renes
author: David Urbanik
published in: Lecture Notes in Computer Science
publication date: 2017-06-13T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 6729682
zbMATH Keywords: post-quantum cryptography
zbMATH Keywords: Diffie-Hellman key exchange
zbMATH Keywords: supersingular elliptic curves
zbMATH Keywords: isogenies
zbMATH Keywords: SIDH
zbMATH Keywords: public-key compression
zbMATH Keywords: Pohlig-Hellman algorithm
describes a project that uses: McEliece
describes a project that uses: SIDH
describes a project that uses: Elligator
MaRDI profile type: Publication
full work available at URL: 978-3-319-56620-7 24
OpenAlex ID: W2573560101
cites work: Efficient pairing computation on supersingular abelian varieties
cites work: Q4409129
cites work: Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
cites work: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
cites work: Secure integration of asymmetric and symmetric encryption schemes
cites work: Q4737495
cites work: On the Security of Supersingular Isogeny Cryptosystems
cites work: Pairing Lattices
cites work: The Eta Pairing Revisited
cites work: Elliptic Curves
cites work: Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
cites work: The Montgomery inverse and its applications
cites work: Q4536791
cites work: The Weil pairing, and its efficient calculation
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: Lattice Cryptography for the Internet
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Advances in Cryptology - CRYPTO 2003
cites work: How to do a 𝑝-descent on an elliptic curve
cites work: Q5628224
cites work: The Arithmetic of Elliptic Curves
cites work: Q4342470
cites work: Q4425716
cites work: Structure computation and discrete logarithms in finite abelian $p$-groups
cites work: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
description: scientific article; zbMATH DE number 6729682