Free Delivery Over $100
|
|
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Thomas R. ShemanskePublisher: American Mathematical Society Imprint: American Mathematical Society Weight: 0.320kg ISBN: 9781470435820ISBN 10: 1470435829 Pages: 252 Publication Date: 30 August 2017 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print  This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsThree 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.ReviewsThe main objective of this book, which is mainly aimed at undergraduate students, is to explain the arithmetic of elliptic curves defined over finite fields and to show how those curves can be used in cryptography. In order to do that, the author purposely avoids complex mathematical demonstrations and, instead, presents the concepts in a more descriptive way, suggesting some topics for further exploration by the reader. - Victor Gayoso Martiinez, Mathematical Reviews Author InformationThomas R. Shemanske, Dartmouth College, Hanover, NH. Tab Content 6Author Website:Countries AvailableAll regions |
||||
