Modern cryptography and elliptic curves : (Record no. 67144)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 02112nam a22001937a 4500 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 210817b2017 ||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9781470454883 |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 516.352 SHE-T |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Shemanske, Thomas R |
245 ## - TITLE STATEMENT | |
Title | Modern cryptography and elliptic curves : |
Remainder of title | a beginner's guide / |
Statement of responsibility, etc. | Thomas R. Shemanske |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication, distribution, etc. | USA |
Name of publisher, distributor, etc. | American Mathematical Society |
Date of publication, distribution, etc. | 2017 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 250 p. |
365 ## - TRADE PRICE | |
Price type code | INR |
Price amount | 1090.00. |
440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE | |
Title | Student Mathematical Library : |
Volume/sequential designation | Volume : 83. |
500 ## - GENERAL NOTE | |
General note | 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).<br/><br/>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.<br/><br/>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. |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Cryptography |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Curves, Elliptic |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Geometry, Algebraic |
952 ## - LOCATION AND ITEM INFORMATION (KOHA) | |
Withdrawn status |
Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Home library | Current library | Shelving location | Date acquired | Total Checkouts | Full call number | Barcode | Date last seen | Date last checked out | Price effective from | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Dewey Decimal Classification | 510 | BITS Pilani Hyderabad | BITS Pilani Hyderabad | General Stack (For lending) | 17/08/2021 | 2 | 516.352 SHE-T | 42541 | 26/07/2023 | 08/02/2023 | 17/08/2021 | Books |