Muutke küpsiste eelistusi

Elliptic Curves: Number Theory and Cryptography [Kõva köide]

(University of Maryland, College Park, USA)
  • Formaat: Hardback, 440 pages, kõrgus x laius: 235x156 mm, kaal: 748 g, 1000 equations; 21 Illustrations, black and white, Contains 24 hardbacks
  • Sari: Discrete Mathematics and Its Applications
  • Ilmumisaeg: 28-May-2003
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 1584883650
  • ISBN-13: 9781584883654
Teised raamatud teemal:
  • Kõva köide
  • Hind: 74,79 €*
  • * saadame teile pakkumise kasutatud raamatule, mille hind võib erineda kodulehel olevast hinnast
  • See raamat on trükist otsas, kuid me saadame teile pakkumise kasutatud raamatule.
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Lisa soovinimekirja
  • Formaat: Hardback, 440 pages, kõrgus x laius: 235x156 mm, kaal: 748 g, 1000 equations; 21 Illustrations, black and white, Contains 24 hardbacks
  • Sari: Discrete Mathematics and Its Applications
  • Ilmumisaeg: 28-May-2003
  • Kirjastus: Chapman & Hall/CRC
  • ISBN-10: 1584883650
  • ISBN-13: 9781584883654
Teised raamatud teemal:
Assuming only a modest background in elementary number theory, groups, and fields, Washington (mathematics, University of Maryland) introduces both the cryptographic and number theoretic sides of elliptic curves. He introduces elliptic curves over finite fields early in the book, leading readers to cryptographic applications, but the book is structured so that readers can explore number theoretic aspects independently if desired. Annotation (c) Book News, Inc., Portland, OR (booknews.com)

Elliptic curves have played an increasingly important role in number theory and related fields over the last several decades, most notably in areas such as cryptography, factorization, and the proof of Fermat's Last Theorem. However, most books on the subject assume a rather high level of mathematical sophistication, and few are truly accessible to senior undergraduate or beginning graduate students.Assuming only a modest background in elementary number theory, groups, and fields, Elliptic Curves: Number Theory and Cryptography introduces both the cryptographic and number theoretic sides of elliptic curves, interweaving the theory of elliptic curves with their applications. The author introduces elliptic curves over finite fields early in the treatment, leading readers directly to the intriguing cryptographic applications, but the book is structured so that readers can explore the number theoretic aspects independently if desired.By side-stepping algebraic geometry in favor an approach based on basic formulas, this book clearly demonstrates how elliptic curves are used and opens the doors to higher-level studies. Elliptic Curves offers a solid introduction to the mathematics and applications of elliptic curves that well prepares its readers to tackle more advanced problems in cryptography and number theory.
Introduction
1(8)
Exercises
8(1)
The Basic Theory
9(64)
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
32(3)
Other Equations for Elliptic Curves
35(6)
Legendre Equation
35(1)
Cubic Equations
35(1)
Quartic Equations
36(3)
Intersection of Two Quadratic Surfaces
39(2)
The j-invariant
41(3)
Elliptic Curves in Characteristic 2
44(2)
Endomorphisms
46(9)
Singular Curves
55(4)
Elliptic Curves mod n
59(14)
Exercises
67(6)
Torsion Points
73(16)
Torsion Points
73(3)
Division Polynomials
76(6)
The Weil Pairing
82(7)
Exercises
86(3)
Elliptic Curves over Finite Fields
89(44)
Examples
89(3)
The Frobenius Endomorphism
92(4)
Determining the Group Order
96(9)
Subfield Curves
96(2)
Legendre Symbols
98(2)
Orders of Points
100(3)
Baby Step, Giant Step
103(2)
A Family of Curves
105(8)
Schoof's Algorithm
113(7)
Supersingular Curves
120(13)
Exercises
130(3)
The Discrete Logarithm Problem
133(26)
The Index Calculus
134(2)
General Attacks on Discrete Logs
136(8)
Baby Step, Giant Step
136(1)
Pollard's ρ and λ Methods
137(4)
The Pohlig-Hellman Method
141(3)
The MOV Attack
144(3)
Anomalous Curves
147(6)
The Tate-Lichtenbaum Pairing
153(3)
Other Attacks
156(3)
Exercises
156(3)
Elliptic Curve Cryptography
159(20)
The Basic Setup
159(1)
Diffie-Hellman Key Exchange
160(3)
Massey-Omura Encryption
163(1)
ElGamal Public Key Encryption
164(1)
ElGamal Digital Signatures
165(3)
The Digital Signature Algorithm
168(1)
A Public Key Scheme Based on Factoring
169(4)
A Cryptosystem Based on the Weil Pairing
173(6)
Exercises
175(4)
Other Applications
179(10)
Factoring Using Elliptic Curves
179(5)
Primality Testing
184(5)
Exercises
187(2)
Elliptic Curves over Q
189(58)
The Torsion Subgroup. The Lutz-Nagell Theorem
189(9)
Descent and the Weak Mordell-Weil Theorem
198(8)
Heights and the Mordell-Weil Theorem
206(8)
Examples
214(7)
The Height Pairing
221(1)
Fermat's Infinite Descent
222(5)
2-Selmer Groups; Shafarevich-Tate Groups
227(2)
A Nontrivial Shafarevich-Tate Group
229(5)
Galois Cohomology
234(13)
Exercises
244(3)
Elliptic Curves over C
247(48)
Doubly Periodic Functions
247(10)
Tori are Elliptic Curves
257(5)
Elliptic Curves over C
262(13)
Computing Periods
275(8)
The Arithmetic-Geometric Mean
277(6)
Division Polynomials
283(12)
Exercises
291(4)
Complex Multiplication
295(28)
Elliptic Curves over C
295(7)
Elliptic Curves over Finite Fields
302(4)
Integrality of j-invariants
306(8)
Numerical Examples
314(6)
Kronecker's Jugendtraum
320(3)
Exercises
321(2)
Divisors
323(32)
Definitions and Examples
323(10)
The Weil Pairing
333(5)
The Tate-Lichtenbaum Pairing
338(3)
Computation of the Pairings
341(5)
Genus One Curves and Elliptic Curves
346(9)
Exercises
353(2)
Zeta Functions
355(16)
Elliptic Curves over Finite Fields
355(4)
Elliptic Curves over Q
359(12)
Exercises
368(3)
Fermat's Last Theorem
371(26)
Overview
371(3)
Galois Representations
374(6)
Sketch of Ribet's Proof
380(7)
Sketch of Wiles's Proof
387(10)
Number Theory 397(6)
Groups 403(4)
Fields 407(8)
References 415(10)
Index 425