Muutke küpsiste eelistusi

Elliptic Curves: Number Theory and Cryptography, Second Edition 2nd edition [Kõva köide]

(University of Maryland, College Park, USA)
  • Formaat: Hardback, 532 pages, kõrgus x laius: 234x156 mm, kaal: 1140 g, 20 Illustrations, black and white
  • Sari: Discrete Mathematics and Its Applications
  • Ilmumisaeg: 03-Apr-2008
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 1420071467
  • ISBN-13: 9781420071467
Teised raamatud teemal:
  • Formaat: Hardback, 532 pages, kõrgus x laius: 234x156 mm, kaal: 1140 g, 20 Illustrations, black and white
  • Sari: Discrete Mathematics and Its Applications
  • Ilmumisaeg: 03-Apr-2008
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 1420071467
  • ISBN-13: 9781420071467
Teised raamatud teemal:
Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. With additional exercises, this edition offers more comprehensive coverage of the fundamental theory, techniques, and applications of elliptic curves.

New to the Second Edition

Chapters on isogenies and hyperelliptic curves A discussion of alternative coordinate systems, such as projective, Jacobian, and Edwards coordinates, along with related computational issues A more complete treatment of the Weil and TateLichtenbaum pairings Douds analytic method for computing torsion on elliptic curves over Q An explanation of how to perform calculations with elliptic curves in several popular computer algebra systems Taking a basic approach to elliptic curves, this accessible book prepares readers to tackle more advanced problems in the field. It introduces elliptic curves over finite fields early in the text, before moving on to interesting applications, such as cryptography, factoring, and primality testing. The book also discusses the use of elliptic curves in Fermats Last Theorem. Relevant abstract algebra material on group theory and fields can be found in the appendices.

Arvustused

the book is well structured and does not waste the readers time in dividing cryptography from number theory-only information. This enables the reader just to pick the desired information. a very comprehensive guide on the theory of elliptic curves. I can recommend this book for both cryptographers and mathematicians doing either their Ph.D. or Masters I enjoyed reading and studying this book and will be glad to have it as a future reference. IACR book reviews, April 2010

Praise for the First Edition There are already a number of books about elliptic curves, but this new offering by Washington is definitely among the best of them. It gives a rigorous though relatively elementary development of the theory of elliptic curves, with emphasis on those aspects of the theory most relevant for an understanding of elliptic curve cryptography. an excellent companion to the books of Silverman and Blake, Seroussi and Smart. It would be a fine asset to any library or collection. Mathematical Reviews, Issue 2004e

Washington has found just the right level of abstraction for a first book . Notably, he offers the most lucid and concrete account ever of the perpetually mysterious ShafarevichTate group. A pleasure to read! Summing Up: Highly recommended. CHOICE, March 2004

a nice, relatively complete, elementary account of elliptic curves. Bulletin of the AMS

Introduction
1(9)
Exercises
8(1)
The Basic Theory
9(68)
Weierstrass Equations
9(3)
The Group Law
12(6)
Projective Space and the Point at Infinity
18(2)
Proof of Associativity
20(15)
The Theorems of Pappus and Pascal
33(2)
Other Equations for Elliptic Curves
35(7)
Legendre Equation
35(1)
Cubic Equations
36(1)
Quartic Equations
37(2)
Intersection of Two Quadratic Surfaces
39(3)
Other Coordinate Systems
42(3)
Projective Coordinates
42(1)
Jacobian Coordinates
43(1)
Edwards Coordinates
44(1)
The j-invariant
45(2)
Elliptic Curves in Characteristic 2
47(3)
Endomorphisms
50(9)
Singular Curves
59(5)
Elliptic Curves mod n
64(13)
Exercises
71(6)
Torsion Points
77(18)
Torsion Points
77(3)
Division Polynomials
80(6)
The Weil Pairing
86(4)
The Tate-Lichtenbaum Pairing
90(5)
Exercises
92(3)
Elliptic Curves over Finite Fields
95(48)
Examples
95(3)
The Frobenius Endomorphism
98(4)
Determining the Group Order
102(13)
Subfield Curves
102(2)
Legendre Symbols
104(2)
Orders of Points
106(6)
Baby Step, Giant Step
112(3)
A Family of Curves
115(8)
Schoof's Algorithm
123(7)
Supersingular Curves
130(13)
Exercises
139(4)
The Discrete Logarithm Problem
143(26)
The Index Calculus
144(2)
General Attacks on Discrete Logs
146(8)
Baby Step, Giant Step
146(1)
Pollard's ρ and λ Methods
147(4)
The Pohlig-Hellman Method
151(3)
Attacks with Pairings
154(5)
The MOV Attack
154(3)
The Frey-Ruck Attack
157(2)
Anomalous Curves
159(6)
Other Attacks
165(4)
Exercises
166(3)
Elliptic Curve Cryptography
169(20)
The Basic Setup
169(1)
Diffie-Hellman Key Exchange
170(3)
Massey-Omura Encryption
173(1)
ElGamal Public Key Encryption
174(1)
ElGamal Digital Signatures
175(4)
The Digital Signature Algorithm
179(1)
ECIES
180(1)
A Public Key Scheme Based on Factoring
181(3)
A Cryptosystem Based on the Weil Pairing
184(5)
Exercises
187(2)
Other Applications
189(10)
Factoring Using Elliptic Curves
189(5)
Primality Testing
194(5)
Exercises
197(2)
Elliptic Curves over Q
199(58)
The Torsion Subgroup. The Lutz-Nagell Theorem
199(9)
Descent and the Weak Mordell-Weil Theorem
208(7)
Heights and the Mordell-Weil Theorem
215(8)
Examples
223(7)
The Height Pairing
230(1)
Fermat's Infinite Descent
231(5)
2-Selmer Groups; Shafarevich-Tate Groups
236(3)
A Nontrivial Shafarevich-Tate Group
239(5)
Galois Cohomology
244(13)
Exercises
253(4)
Elliptic Curves over C
257(54)
Doubly Periodic Functions
257(10)
Tori are Elliptic Curves
267(5)
Elliptic Curves over C
272(14)
Computing Periods
286(8)
The Arithmetic-Geometric Mean
288(6)
Division Polynomials
294(8)
The Torsion Subgroup: Doud's Method
302(9)
Exercises
307(4)
Complex Multiplication
311(28)
Elliptic Curves over C
311(7)
Elliptic Curves over Finite Fields
318(4)
Integrality of j-invariants
322(8)
Numerical Examples
330(6)
Kronecker's Jugendtraum
336(3)
Exercises
337(2)
Divisors
339(42)
Definitions and Examples
339(10)
The Weil Pairing
349(5)
The Tate-Lichtenbaum Pairing
354(4)
Computation of the Pairings
358(6)
Genus One Curves and Elliptic Curves
364(6)
Equivalence of the Definitions of the Pairings
370(5)
The Weil Pairing
371(3)
The Tate-Lichtenbaum Pairing
374(1)
Nondegeneracy of the Tate-Lichtenbaum Pairing
375(6)
Exercises
379(2)
Isogenies
381(26)
The Complex Theory
381(5)
The Algebraic Theory
386(6)
Velu's Formulas
392(4)
Point Counting
396(5)
Complements
401(6)
Exercises
402(5)
Hyperelliptic Curves
407(22)
Basic Definitions
407(2)
Divisors
409(8)
Cantor's Algorithm
417(3)
The Discrete Logarithm Problem
420(9)
Exercises
426(3)
Zeta Functions
429(16)
Elliptic Curves over Finite Fields
429(4)
Elliptic Curves over Q
433(12)
Exercises
442(3)
Fermat's Last Theorem
445(26)
Overview
445(1)
Galois Representations
445(9)
Sketch of Ribet's Proof
454(7)
Sketch of Wiles's Proof
461(10)
A. Number Theory
471(6)
B. Groups
477(4)
C. Fields
481(8)
D. Computer Packages
489(12)
D.1 Pari
489(3)
D.2 Magma
492(2)
D.3 SAGE
494(7)
References 501(8)
Index 509
Lawrence C. Washington