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 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.
by Charles Ashbacher - Erhus University Press
This text deals with some advanced consequences of the Smarandache function. The reading of this book is a form of mindjoining, where the author tries to create the opportunity for a shared experience of an adventure.
by Edward Frenkel - Cambridge University Press
This book provides a review of an important aspect of the geometric Langlands program - the role of representation theory of affine Kac-Moody algebras. It provides introductions to such notions as vertex algebras, the Langlands dual group, etc.