Fetching the paper…
Reading the bibliography…
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Groupes de Lie l l -adiques attachés aux courbes elliptiques
Jean-Pierre Serre · 1966
Earlier work this paper cites.
Endomorphisms of abelian varieties over finite fields
John Tate · 1966
Earlier work this paper cites.
Abelian varieties over finite fields
William C. Waterhouse · 1969
Earlier work this paper cites.
Isogénies entre courbes elliptiques
Jacques Vélu · 1971
Earlier work this paper cites.
The arithmetic of elliptic curves
Joseph H. Silverman · 1986
Earlier work this paper cites.
A probabilistic factorization algorithm with quadratic forms of negative discriminant
Martin Seysen · 1987
Earlier work this paper cites.
Primes of the form x 2 + n y 2 x^{2}+ny^{2} : Fermat, class field theory and complex multiplication
David A. Cox · 1989
Earlier work this paper cites.
Explicit bounds for primality testing and related problems
Eric Bach · 1990
Earlier work this paper cites.
Fast reduction and composition of binary quadratic forms
Arnold Schönhage · 1991
Earlier work this paper cites.
Counting points on elliptic curves over finite fields
René Schoof · 1993
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W. Shor · 1997
Earlier work this paper cites.
Constructing isogenies between elliptic curves over finite fields
Steven D. Galbraith · 1999
Earlier work this paper cites.
On quantum algorithms for noncommutative hidden subgroups
Mark Ettinger and Peter Høyer · 2000
Cited alongside, same era.
Decomposing finite abelian groups
Kevin K. H. Cheung and Michele Mosca · 2001
Cited alongside, same era.
Quantum algorithms for some hidden shift problems
Wim van Dam, Sean Hallgren, and Lawrence Ip · 2002
Cited alongside, same era.
Isogeny volcanoes and the SEA algorithm
M. Fouquet and F. Morain · 2002
Cited alongside, same era.
Extending the GHS Weil descent attack
Steven D. Galbraith, Florian Hess, and Nigel P. Smart · 2002
Cited alongside, same era.
How to find smooth parts of integers, 2004
Daniel J. Bernstein · 2004
Cited alongside, same era.
A subexponential-time quantum algorithm for the dihedral hidden subgroup problem
Evaluating large degree isogenies and applications to pairing based cryptography
Reinier Bröker, Denis Charles, and Kristin Lauter · 2008
Later among the works it cites.
On Elkies subgroups of l l -torsion points in elliptic curves defined over a finite field
Reynald Lercier and Thomas Sirvent · 2008
Later among the works it cites.
Computing the endomorphism ring of an ordinary elliptic curve over a finite field
Gaetan Bisson and Andrew V. Sutherland · 2009
Later among the works it cites.
Expander graphs based on GRH with an application to elliptic curve cryptography
David Jao, Stephen D. Miller, and Ramarathnam Venkatesan · 2009
Later among the works it cites.
Quantum resistant public key cryptography: a survey
Ray A. Perlner and David A. Cooper · 2009
Later among the works it cites.
Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Greg Kuperberg · 2005
Cited alongside, same era.
Hard homogeneous spaces, 2006
Jean-Marc Couveignes · 2006
Cited alongside, same era.
Public-key cryptosystem based on isogenies, 2006
Alexander Rostovtsev and Anton Stolbunov · 2006
Cited alongside, same era.
Binary quadratic forms: An algorithmic approach
Johannes Buchmann and Ulrich Vollmer · 2007
Cited alongside, same era.
Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem
Sean Hallgren · 2007
Cited alongside, same era.
Fast algorithms for computing isogenies between elliptic curves
Alin Bostan, François Morain, Bruno Salvy, and Éric Schost · 2008
Cited alongside, same era.
Luca De Feo · 2010
Closest in time.
Speed records for NTRU
Jens Hermans, Frederik Vercauteren, and Bart Preneel · 2010
Closest in time.
Pairing the volcano
Sorina Ionica and Antoine Joux · 2010
Closest in time.
A subexponential algorithm for evaluating large degree isogenies
David Jao and Vladimir Soukharev · 2010
Closest in time.
Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
Anton Stolbunov · 2010
Closest in time.
Computing endomorphism rings of elliptic curves under the GRH
Gaetan Bisson · 2011
Closest in time.
Improved algorithm for the isogeny problem for ordinary elliptic curves, 2011
Steven D. Galbraith and Anton Stolbunov · 2011
Closest in time.