Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Für diesen Artikel ist leider kein Bild verfügbar.

Algorithms for Modular Elliptic Curves Full Canadian Binding

(Autor)

Buch | Softcover
384 Seiten
1997 | 2nd Revised edition
Cambridge University Press (Verlag)
978-0-521-59820-0 (ISBN)
CHF 89,95 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
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.
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, now in its second edition, presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves, with remarks on computer implementation. It is in three parts. First, the author describes in detail the construction of modular elliptic curves, giving an explicit algorithm for their computation using modular symbols. Secondly a collection of algorithms for the arithmetic of elliptic curves is presented; some of these have not appeared in book form before. They include: finding torsion and non-torsion points, computing heights, finding isogenies and periods, and computing the rank. Finally, an extensive set of tables is provided giving the results of the author's implementation of the algorithms. These tables extend the widely used 'Antwerp IV tables' in two ways: the range of conductors (up to 1000), and the level of detail given for each curve. In particular, the quantities relating to the Birch Swinnerton-Dyer conjecture have been computed in each case and are included. All researchers and graduate students of number theory will find this book useful, particularly those interested in the computational side of the subject. That aspect will make it appeal also to computer scientists and coding theorists.

1. Introduction; 2. Modular symbol algorithms; Appendix to chapter 2. Examples; 3. Elliptic curve algorithms; 4. The tables; Bibliography.

Erscheint lt. Verlag 15.5.1997
Zusatzinfo 727 Tables, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 298 x 220 mm
Gewicht 1145 g
Themenwelt Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Arithmetik / Zahlentheorie
ISBN-10 0-521-59820-6 / 0521598206
ISBN-13 978-0-521-59820-0 / 9780521598200
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren

von Michael Karbach

Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90