Modern Cryptography and Elliptic Curves
A Beginner's Guide
Seiten
2017
American Mathematical Society (Verlag)
978-1-4704-3582-0 (ISBN)
American Mathematical Society (Verlag)
978-1-4704-3582-0 (ISBN)
This book offers the beginning undergraduate student some of the vista of modern mathematics by developing and presenting the tools needed to gain an understanding of the arithmetic of elliptic curves over finite fields and their applications to modern cryptography. This gradual introduction also makes a significant effort to teach students how to produce or discover a proof by presenting mathematics as an exploration, and at the same time, it provides the necessary mathematical underpinnings to investigate the practical and implementation side of elliptic curve cryptography (ECC).
Elements of abstract algebra, number theory, and affine and projective geometry are introduced and developed, and their interplay is exploited. Algebra and geometry combine to characterize congruent numbers via rational points on the unit circle, and group law for the set of points on an elliptic curve arises from geometric intuition provided by Bezout's theorem as well as the construction of projective space. The structure of the unit group of the integers modulo a prime explains RSA encryption, Pollard's method of factorization, Diffie-Hellman key exchange, and ElGamal encryption, while the group of points of an elliptic curve over a finite field motivates Lenstra's elliptic curve factorization method and ECC.
The only real prerequisite for this book is a course on one-variable calculus; other necessary mathematical topics are introduced on-the-fly. Numerous exercises further guide the exploration.
Elements of abstract algebra, number theory, and affine and projective geometry are introduced and developed, and their interplay is exploited. Algebra and geometry combine to characterize congruent numbers via rational points on the unit circle, and group law for the set of points on an elliptic curve arises from geometric intuition provided by Bezout's theorem as well as the construction of projective space. The structure of the unit group of the integers modulo a prime explains RSA encryption, Pollard's method of factorization, Diffie-Hellman key exchange, and ElGamal encryption, while the group of points of an elliptic curve over a finite field motivates Lenstra's elliptic curve factorization method and ECC.
The only real prerequisite for this book is a course on one-variable calculus; other necessary mathematical topics are introduced on-the-fly. Numerous exercises further guide the exploration.
Thomas R. Shemanske, Dartmouth College, Hanover, NH.
Three motivating problems
Back to the beginning
Some elementary number theory
A second view of modular arithmetic: $/mathbb{Z}_n$ and $U_n$
Public-key cryptography and RSA
A little more algebra
Curves in affine and projective space
Applications of elliptic curves
Deeper results and concluding thoughts
Answers to selected exercises
Bibliography
Index.
Erscheinungsdatum | 28.09.2017 |
---|---|
Reihe/Serie | Student Mathematical Library |
Verlagsort | Providence |
Sprache | englisch |
Maße | 140 x 216 mm |
Gewicht | 320 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie |
Mathematik / Informatik ► Mathematik ► Geometrie / Topologie | |
ISBN-10 | 1-4704-3582-9 / 1470435829 |
ISBN-13 | 978-1-4704-3582-0 / 9781470435820 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Sieben ausgewählte Themenstellungen
Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
59,95 €
Buch | Softcover (2022)
Springer Spektrum (Verlag)
29,99 €
Buch | Hardcover (2018)
John Wiley & Sons Inc (Verlag)
132,63 €