From the elliptic regulator to exotic relations.
Touafek, Nouressadat (2008)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Displaying similar documents to “A Lax formalism for the elliptic difference Painlevé equation.”
From the elliptic regulator to exotic relations.
On the division polynomials of elliptic curves.
J. González (2000)
Revista de la Real Academia de Ciencias Exactas Físicas y Naturales
Similarity:
A splitting criterion for two-dimensional semi-tori.
Winkelmann, Jörg (2004)
Journal of Lie Theory
Similarity:
Some families of non-congruent numbers
Franz Lemmermeyer (2003)
Acta Arithmetica
Similarity:
Elliptic Carmichael numbers and elliptic Korselt criteria
Joseph H. Silverman (2012)
Acta Arithmetica
Similarity:
A remark about elliptic overdeterminated systems
Giuliano Bratti (1977)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Approximating algebraic numbers by j-invariants of elliptic curves
Patrick Ingram (2008)
Acta Arithmetica
Similarity:
The uniform primality conjecture for elliptic curves
Graham Everest, Patrick Ingram, Valéry Mahé, Shaun Stevens (2008)
Acta Arithmetica
Similarity:
On the number of large integer points on elliptic curves
P. G. Walsh (2009)
Acta Arithmetica
Similarity:
Product formulae on elliptic curves.
Daniel S. Kubert (1994)
Inventiones mathematicae
Similarity:
A note on elliptic curves over finite fields
J.F. Voloch (1988)
Bulletin de la Société Mathématique de France
Similarity:
A note on arithmetic progressions on elliptic curves.
Campbell, Garikai (2003)
Journal of Integer Sequences [electronic only]
Similarity:
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 definitions regarding computational complexity theory and review some basic cryptography protocols based on RSA or elliptic curves. These protocols summarize the history of the last fifty 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...