Marknadens största urval
Snabb leverans

Elliptic Curves

- Number Theory and Cryptography, Second Edition

Om Elliptic Curves

Like its bestselling predecessor, this book develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. This edition now includes alternative coordinate systems and related computational issues, a more elementary treatment of the Tate???Lichtenbaum pairing, additional elliptic curve cryptosystems, and Doud??'s analytic method for computing torsion on elliptic curves over Q. It also contains new chapters on isogenies and hyperelliptic curves as well as discusses how to compute elliptic curves in some popular computer algebra systems. Basic exercises appear at the end of each chapter, with selected answers in an appendix.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9781420071467
  • Format:
  • Inbunden
  • Sidor:
  • 532
  • Utgiven:
  • 3. april 2008
  • Utgåva:
  • 2
  • Mått:
  • 167x244x30 mm.
  • Vikt:
  • 1122 g.
Leveranstid: 2-4 veckor
Förväntad leverans: 16. december 2024

Beskrivning av Elliptic Curves

Like its bestselling predecessor, this book develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. This edition now includes alternative coordinate systems and related computational issues, a more elementary treatment of the Tate???Lichtenbaum pairing, additional elliptic curve cryptosystems, and Doud??'s analytic method for computing torsion on elliptic curves over Q. It also contains new chapters on isogenies and hyperelliptic curves as well as discusses how to compute elliptic curves in some popular computer algebra systems. Basic exercises appear at the end of each chapter, with selected answers in an appendix.

Användarnas betyg av Elliptic Curves



Hitta liknande böcker
Boken Elliptic Curves finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.