Algorithms for Modular Elliptic Curves
by J. E. Cremona
Publisher: Cambridge University Press 1992
Number of pages: 351
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.
Home page url
Download or read it online for free here:
(multiple PDF files)
by Pete L. Clark - University of Georgia
The goal is to find and explore open questions in both geometry of numbers -- e.g. Lattice Point Enumerators, the Ehrhart-Polynomial, Minkowski's Convex Body Theorems, Minkowski-Hlawka Theorem, ... -- and its applications to number theory.
by Charles Ashbacher - Erhus Univ Pr
In the 1970's a Rumanian mathematician Florentin Smarandache created a new function in number theory, which consequences encompass many areas of mathematics.The purpose of this text is to examine some of those consequences.
by A. Genestier, B.C. Ngo
The goal of these lectures is to explain the representability of moduli space abelian varieties with polarization, endomorphism and level structure, due to Mumford and the description of the set of its points over a finite field, due to Kottwitz.
by Krassimir Atanassov - Erhus Univ Pr
A collection of 27 Smarandache's problems which the autor solved by 1999. 22 problems are related to different sequences, 4 problems are proved, modifications of two problems are formulated, and counterexamples to two of the problems are constructed.