Supersingular isogeny key exchange

Supersingular isogeny Diffie–Hellman key exchange (SIDH) is a post-quantum cryptographic algorithm used to establish a secret key between two parties… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We describe the structure of Tate-Shafarevich groups of a constant elliptic curves over function fields by exploiting the volcano… (More)
Is this relevant?
2018
2018
Public-key cryptography in use today can be broken by a quantum computer with sufficient resources. Microsoft Research has… (More)
  • table 3.1
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • table 6.1
Is this relevant?
2016
2016
We study cryptosystems based on supersingular isogenies. This is an active area of research in post-quantum cryptography. Our… (More)
  • table 1
Is this relevant?
Review
2015
Review
2015
In this report we review four post-quantum cryptosystems: the ring learning with errors key exchange, the supersingular isogeny… (More)
  • table 1
Is this relevant?
2012
2012
Isogeny volcanoes are graphs whose vertices are elliptic curves and whose edges are l-isogenies. Algorithms allowing to travel on… (More)
Is this relevant?
2011
2011
We present a new algorithm to compute the classical modular polynomial l in the rings Z(X;Y ) and (Z=mZ)(X;Y ), for a prime l and… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2010
2010
Isogeny volcanoes are graphs whose vertices are elliptic curves and whose edges are $\ell$-isogenies. Algorithms allowing to… (More)
  • figure 1
  • table 1
Is this relevant?
2008
2008
The usage of elliptic curve cryptography in smart cards has been shown to be efficient although, when considering curves, one… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2007
2007
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Recently, Kohel gave algorithms to compute the conductor of the endomorphism ring of an ordinary elliptic curve, given the… (More)
Is this relevant?