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
Essays on the Theory of Numbersby Richard Dedekind - The Open Court Publishing
This is a book combining two essays: 'Continuity and irrational numbers' - Dedekind's way of defining the real numbers from rational numbers; and 'The nature and meaning of numbers' where Dedekind offers a precise explication of the natural numbers.
(14880 views)
Collections of Problems on Smarandache Notionsby 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.
(18086 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 ...
(9337 views)
Predicative Arithmeticby Edward Nelson - Princeton Univ Pr
The book based on lecture notes of a course given at Princeton University in 1980. From the contents: the impredicativity of induction, the axioms of arithmetic, order, induction by relativization, the bounded least number principle, and more.
(19074 views)