Fetching the paper…
Reading the bibliography…
A low storage algorithm for constructing isogenies between ordinary elliptic curves was proposed by Galbraith, Hess and Smart (GHS).
Cycle distributions in random nets
Anatol Rapoport · 1948
Earlier work this paper cites.
Probability distributions related to random mappings
Bernard Harris · 1960
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.
A Monte Carlo method for factorization
J. M. Pollard · 1975
Earlier work this paper cites.
Monte Carlo methods for index computation ( mod p ) ({\rm mod}\ p)
J. M. Pollard · 1978
Earlier work this paper cites.
Factorization of the eighth Fermat number
Richard P. Brent and John M. Pollard · 1981
Earlier work this paper cites.
Quadratic fields and factorization
R. J. Schoof · 1982
Earlier work this paper cites.
Heuristics on class groups of number fields
H. Cohen and H. W. Lenstra, Jr · 1984
Earlier work this paper cites.
Endomorphism rings of elliptic curves over finite fields
D. R. Kohel · 1996
Earlier work this paper cites.
Random random walks on the integers mod n n
Jack J. Dai and Martin V. Hildebrand · 1997
Earlier work this paper cites.
The Art of Computer Programming. Vol. 2. Seminumerical Algorithms. Third Edition
Donald E. Knuth · 1997
Earlier work this paper cites.
The number of partitions in Pollard rho, May 1998
Simon R. Blackburn and Sean Murphy · 1998
Earlier work this paper cites.
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Makoto Matsumoto and Takuji Nishimura · 1998
Cited alongside, same era.
Constructing isogenies between elliptic curves over finite fields
Steven D. Galbraith · 1999
Cited alongside, same era.
Parallel collision search with cryptanalytic applications
Paul C. van Oorschot and Michael J. Wiener · 1999
Cited alongside, same era.
Collision search in a random mapping: some asymptotic results
E. Schulte-Geers · 2000
Cited alongside, same era.
Lecture notes: Randomized methods in computation, 2001
Oded Goldreich · 2001
Cited alongside, same era.
On random walks for Pollard’s rho method
Edlyn Teske · 2001
Cited alongside, same era.
An elliptic curve trapdoor system
Edlyn Teske · 2006
Later among the works it cites.
Elliptic curve cryptography: The serpentine course of a paradigm shift
Ann Hibner Koblitz, Neal Koblitz, and Alfred Menezes · 2008
Later among the works it cites.
Breaking ECC2K-130
Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier van Damme, Giacomo de Meulenaer, Luis Julian Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank Gurkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, and Bo-Yin Yang · 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.
Improvements in the computation of ideal class groups of imaginary quadratic number fields
Jean-François Biasse · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Extending the GHS Weil descent attack
Steven D. Galbraith, Florian Hess, and Nigel P. Smart · 2002
Cited alongside, same era.
Fundamentals of Probability and Statistics for Engineers
T. T. Soong · 2004
Cited alongside, same era.
Do all elliptic curves of the same order have the same difficulty of discrete log?
David Jao, Stephen D. Miller, and Ramarathnam Venkatesan · 2005
Cited alongside, same era.
Hard homogeneous spaces
Jean-Marc Couveignes · 2006
Cited alongside, same era.
Numerical results on class groups of imaginary quadratic fields
Michael J. Jacobson, Jr., Shantha Ramachandran, and Hugh C. Williams · 2006
Cited alongside, same era.
Public-key cryptosystem based on isogenies
Alexander Rostovtsev and Anton Stolbunov · 2006
Cited alongside, same era.
Andrew M. Childs, David Jao, and Vladimir Soukharev · 2010
Later among the works it cites.
Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
Anton Stolbunov · 2010
Later among the works it cites.
Integer hash function
Thomas Wang · 2010
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 · 2011
Closest in time.
An authenticated key agreement protocol using isogenies between elliptic curves
He Debiao, Chen Jianhua, and Hu Jin · 2011
Closest in time.
A simple heuristic for complexity of birthday attacks
Ravi Montenegro · 2011
Closest in time.
ClassEll package, ver. 0.1
Anton Stolbunov · 2011
Closest in time.