Algorithms for Modular Elliptic Curves
by J. E. Cremona
Publisher: Cambridge University Press 1992
ISBN/ASIN: 0521418135
ISBN-13: 9780521418133
Number of pages: 351
Description:
Elliptic curves are of central importance in computational number theory with numerous applications in such areas as cryptography primality testing and factorization. This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves complete with computer implementation. In the first part the author describes in detail the construction of modular elliptic curves giving an explicit algorithm for their computation. Then a collection of algorithms for the arithmetic of elliptic curves is presented, some of these have not appeared in book form before. Finally an extensive set of tables is provided giving the results of the author's implementations of the algorithms.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books
Arithmetic Duality Theoremsby J.S. Milne - BookSurge Publishing
This book, intended for research mathematicians, proves the duality theorems that have come to play an increasingly important role in number theory and arithmetic geometry, for example, in the proof of Fermat's Last Theorem.
(18327 views)
Elliptic Curves over Function Fieldsby Douglas Ulmer - arXiv
The focus is on elliptic curves over function fields over finite fields. We explain the main classical results on the Birch and Swinnerton-Dyer conjecture in this context and its connection to the Tate conjecture about divisors on surfaces.
(13817 views)
Topics in the Theory of Quadratic Residuesby Steve Wright - arXiv
Beginning with Gauss, the study of quadratic residues and nonresidues has subsequently led directly to many of the ideas and techniques that are used everywhere in number theory today, and the primary goal of these lectures is to use this study ...
(10535 views)
Geometric Theorems and Arithmetic Functionsby Jozsef Sandor - American Research Press
Contents: on Smarandache's Podaire theorem, Diophantine equation, the least common multiple of the first positive integers, limits related to prime numbers, a generalized bisector theorem, values of arithmetical functions and factorials, and more.
(21479 views)