Modern Cryptography and Elliptic Curves
Thomas R. Shemanske
jul. 2017 · Student Mathematical Library Bog 83 · American Mathematical Soc.
E-bog
252
Sider
reportBedømmelser og anmeldelser verificeres ikke Få flere oplysninger
Om denne e-bog
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 Bézout'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 Bézout'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.
Om forfatteren
Thomas R. Shemanske: Dartmouth College, Hanover, NH
Bedøm denne e-bog
Fortæl os, hvad du mener.
Oplysninger om læsning
Smartphones og tablets
Installer appen Google Play Bøger til Android og iPad/iPhone. Den synkroniserer automatisk med din konto og giver dig mulighed for at læse online eller offline, uanset hvor du er.
Bærbare og stationære computere
Du kan høre lydbøger, du har købt i Google Play via browseren på din computer.
e-læsere og andre enheder
Hvis du vil læse på e-ink-enheder som f.eks. Kobo-e-læsere, skal du downloade en fil og overføre den til din enhed. Følg den detaljerede vejledning i Hjælp for at overføre filerne til understøttede e-læsere.
