Modern Cryptography and Elliptic Curves
Thomas R. Shemanske
xul. de 2017 · Student Mathematical Library Libro 83 · American Mathematical Soc.
Libro electrónico
252
Páxinas
reportAs valoracións e as recensións non están verificadas Máis información
Acerca deste libro electrónico
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.
Acerca do autor
Thomas R. Shemanske: Dartmouth College, Hanover, NH
Valora este libro electrónico
Dános a túa opinión.
Información de lectura
Smartphones e tabletas
Instala a aplicación Google Play Libros para Android e iPad/iPhone. Sincronízase automaticamente coa túa conta e permíteche ler contido en liña ou sen conexión desde calquera lugar.
Portátiles e ordenadores de escritorio
Podes escoitar os audiolibros comprados en Google Play a través do navegador web do ordenador.
Lectores de libros electrónicos e outros dispositivos
Para ler contido en dispositivos de tinta electrónica, como os lectores de libros electrónicos Kobo, é necesario descargar un ficheiro e transferilo ao dispositivo. Sigue as instrucións detalladas do Centro de Axuda para transferir ficheiros a lectores electrónicos admitidos.
