Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
  • C. Costello
  • IACR Cryptol. ePrint Arch.
  • 2019
  • Corpus ID: 208179402
This is an informal tutorial on the supersingular isogeny Diffie-Hellman protocol aimed at non-isogenists. 
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2019
2019
We describe the structure of Tate-Shafarevich groups of a constant elliptic curves over function fields by exploiting the volcano… Expand
Is this relevant?
Highly Cited
2016
Highly Cited
2016
We study cryptosystems based on supersingular isogenies. This is an active area of research in post-quantum cryptography. Our… Expand
  • table 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
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… Expand
  • table 1
  • table 2
  • table 3
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… Expand
Is this relevant?
2012
2012
The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them… Expand
Is this relevant?
2010
2010
Isogeny volcanoes are graphs whose vertices are elliptic curves and whose edges are l-isogenies. Algorithms allowing to travel on… Expand
  • figure 1
  • table 1
Is this relevant?
2010
2010
Alberta Number Theory Days fell at the very start of the newly formed PIMS CRG in Number Theory, and was thus an excellent… Expand
Is this relevant?
2007
2007
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem… Expand
  • 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… Expand
  • table 1
  • figure 1
  • table 2
Is this relevant?