• Title: Algorithms for Modular Elliptic Curves
• Author(s) J. E. Cremona
• Publisher: Cambridge University Press (November 27, 1992); 2nd Edition (1997)
• Hardcover/Paperback: 351 pages
• eBook: PDF Files, DVI, PostScript, etc.
• Language: English
• ISBN-10: 0521418135
• ISBN-13: 978-0521418133
• Share This:  

Book Description

Elliptic curves are of central and growing importance in computational number theory, with numerous applications in such areas as cryptography, primality testing and factorisation.

This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves, with remarks on computer implementation. An extensive set of tables is provided giving the results of the author's implementation of the algorithms.

Although the idea of using modular symbols for computing the modular elliptic curves defined over Q with conductor N is not new, neither the complete description of the algorithm nor the description of its implementation had been available before the writing of this book; moreover, the complete list of all the modular curves defined over Q with conductor less than 999...will prove very useful for any mathematician interested in the arithmetic of elliptic curves.

• N/A

• Amazon

• Geometry and Topology
• Number Theory
• Algorithms and Data Structures
• Computational and Algorithmic Mathematics
• Mathematical and Computational Software

• Algorithms for Modular Elliptic Curves, 2nd Edition (J. E. Cremona)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF

• Curves and Surfaces in Geometric Modeling: Theory and Algorithms

  This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation. It is also an exellent introduction to geometry concepts used in computer graphics, vision, robotics, geometric modeling.

• Computational Geometry: Methods and Applications (Jianer Chen)

  An introduction to some of the fundamental principles of computational geometry, concentrates on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems.

• Algorithms in Real Algebraic Geometry (Saugata Basu, et al)

  The monograph gives a self-contained detailed exposition of the algorithmic real algebraic geometry. It will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.

• Computations in Algebraic Geometry with Macaulay 2 (D.Eisenbud)

  This book presents algorithmic tools for algebraic geometry and experimental applications of them using Macaulay 2. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out.

• Combinatorial and Computational Geometry (Jacob E. Goodman)

  It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.

• A Computational Introduction to Number Theory and Algebra

  This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. It covers the basics of number theory, abstract algebra and discrete probability theory.

• Algorithms and Data Structures: Apps to Graphics and Geometry

  An introductory coverage of algorithms and data structures with application to graphics and geometry aims to show a sample of the intellectual demands required by a computer science curriculum, exercises, many with solutions, are included throughout the book.