Finding the eigenvalue in Elkies' algorithm.

Maurer, Markus; Müller, Volker

Displaying similar documents to “Finding the eigenvalue in Elkies' algorithm.”

A review about public cryptography protocols based on RSA or elliptic curves

Antonio Corbo Esposito, Cristian Tirelli (2019)

Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche

Similarity:

We provide the basic deﬁnitions regarding computational complexity theory and review some basic cryptography protocols based on RSA or elliptic curves. These protocols summarize the history of the last ﬁfty years in cryptography and are actually ubiquitous in applications, as for example SSL (secure socket layers), smartcards, creation of a bitcoin wallet etc. Since it is known they are in the polynomial class for the Shor’s algorithm, the possible development of quantum computers, needed...

Reductions of an elliptic curve with almost prime orders

Alina Carmen Cojocaru (2005)

Acta Arithmetica

Similarity:

On the number of prime divisors of the order of elliptic curves modulo p

Jörn Steuding, Annegret Weng (2005)

Acta Arithmetica

Similarity:

Class numbers of ring class fields of prime conductor

Omer Kucuksakalli (2012)

Acta Arithmetica

Similarity:

Erratum: "On the number of prime divisors of the order of elliptic curves modulo p" (Acta Arith. 117 (2005), 341-352)

Jörn Steuding, Annegret Weng (2005)

Acta Arithmetica

Similarity:

Counting points on elliptic curves over finite fields

René Schoof (1995)

Journal de théorie des nombres de Bordeaux

Similarity:

We describe three algorithms to count the number of points on an elliptic curve over a finite field. The first one is very practical when the finite field is not too large ; it is based on Shanks's baby-step-giant-step strategy. The second algorithm is very efficient when the endomorphism ring of the curve is known. It exploits the natural lattice structure of this ring. The third algorithm is based on calculations with the torsion points of the elliptic curve [18]. This deterministic...