Modern Cryptography and Elliptic Curves
Thomas R. Shemanske
Tem 2017 · Student Mathematical Library Kitap 83 · American Mathematical Soc.
E-kitap
252
Sayfa
reportPuanlar ve yorumlar doğrulanmaz Daha Fazla Bilgi
Bu e-kitap hakkında
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.
Yazar hakkında
Thomas R. Shemanske: Dartmouth College, Hanover, NH
Bu e-kitaba puan verin
Düşüncelerinizi bizimle paylaşın.
Okuma bilgileri
Akıllı telefonlar ve tabletler
Android ve iPad/iPhone için Google Play Kitaplar uygulamasını yükleyin. Bu uygulama, hesabınızla otomatik olarak senkronize olur ve nerede olursanız olun çevrimiçi veya çevrimdışı olarak okumanıza olanak sağlar.
Dizüstü bilgisayarlar ve masaüstü bilgisayarlar
Bilgisayarınızın web tarayıcısını kullanarak Google Play'de satın alınan sesli kitapları dinleyebilirsiniz.
e-Okuyucular ve diğer cihazlar
Kobo eReader gibi e-mürekkep cihazlarında okumak için dosyayı indirip cihazınıza aktarmanız gerekir. Dosyaları desteklenen e-kitap okuyuculara aktarmak için lütfen ayrıntılı Yardım Merkezi talimatlarını uygulayın.
