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 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 ...
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 J.S. Milne
This is an introduction to the theory of Shimura varieties, or, in other words, to the arithmetic theory of automorphic functions and holomorphic automorphic forms. Because of their brevity, many proofs have been omitted or only sketched.
by Greg W. Anderson - The University of Arizona
This is a compilation of exercises, worked examples and key references that the author compiled in order to help readers learn their way around fermionic Fock space. The text is suitable for use by graduate students with an interest in number theory.