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 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 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.
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.
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.