 # Algorithms for Modular Elliptic Curves Algorithms for Modular Elliptic Curves
by

Publisher: Cambridge University Press
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.

(multiple PDF files)

## Similar books Comments and topics on Smarandache notions and problems
by - Erhus University Press
An examination of some of the problems posed by Florentin Smarandache. The problems are from different areas, such as sequences, primes and other aspects of number theory. The problems are solved in the book, or the author raises new questions.
(9058 views) Predicative Arithmetic
by - 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.
(13447 views) Essays on the Theory of Numbers
by - 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.
(9594 views) Geometric Theorems and Arithmetic Functions
by - 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.
(13495 views)