| 000 | 00000cam u2200205 a 4500 | |
| 001 | 000045857482 | |
| 005 | 20160115172728 | |
| 008 | 160115s2012 enk b 001 0 eng d | |
| 010 | ▼a 2011042606 | |
| 020 | ▼a 9781107013926 | |
| 035 | ▼a (KERIS)REF000016584988 | |
| 040 | ▼a DLC ▼c DLC ▼d DLC ▼d 211009 | |
| 050 | 0 0 | ▼a QA268 ▼b .G35 2012 |
| 082 | 0 0 | ▼a 003/.54 ▼2 23 |
| 084 | ▼a 003.54 ▼2 DDCK | |
| 090 | ▼a 003.54 ▼b G148m | |
| 100 | 1 | ▼a Galbraith, Steven D. |
| 245 | 1 0 | ▼a Mathematics of public key cryptography / ▼c Steven D. Galbraith. |
| 260 | ▼a Cambridge ; ▼a New York : ▼b Cambridge University Press, ▼c 2012. | |
| 300 | ▼a xiv, 615 p. ; ▼c 26 cm. | |
| 504 | ▼a Includes bibliographical references (p. 579-602) and indexes. | |
| 520 | ▼a "Public key cryptography is a major interdisciplinary subject with many real-world applications, such as digital signatures. A strong background in the mathematics underlying public key cryptography is essential for a deep understanding of the subject, and this book provides exactly that for students and researchers in mathematics, computer science and electrical engineering. Carefully written to communicate the major ideas and techniques of public key cryptography to a wide readership, this text is enlivened throughout with historical remarks and insightful perspectives on the development of the subject. Numerous examples, proofs and exercises make it suitable as a textbook for an advanced course, as well as for self-study. For more experienced researchers it serves as a convenient reference for many important topics: the Pollard algorithms, Maurer reduction, isogenies, algebraic tori, hyperelliptic curves and many more"-- ▼c Provided by publisher. | |
| 650 | 0 | ▼a Coding theory. |
| 650 | 0 | ▼a Cryptography ▼x Mathematics. |
| 945 | ▼a KLPA |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 003.54 G148m | 등록번호 121235357 (5회 대출) | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
책소개
Public key cryptography is a major interdisciplinary subject with many real-world applications, such as digital signatures. A strong background in the mathematics underlying public key cryptography is essential for a deep understanding of the subject, and this book provides exactly that for students and researchers in mathematics, computer science and electrical engineering. Carefully written to communicate the major ideas and techniques of public key cryptography to a wide readership, this text is enlivened throughout with historical remarks and insightful perspectives on the development of the subject. Numerous examples, proofs and exercises make it suitable as a textbook for an advanced course, as well as for self-study. For more experienced researchers it serves as a convenient reference for many important topics: the Pollard algorithms, Maurer reduction, isogenies, algebraic tori, hyperelliptic curves and many more.
This advanced graduate textbook gives an authoritative and insightful description of the major ideas and techniques of public key cryptography.
정보제공 :
목차
Preface; Acknowledgements; 1. Introduction; Part I. Background: 2. Basic algorithmic number theory; 3. Hash functions and MACs; Part II. Algebraic Groups: 4. Preliminary remarks on algebraic groups; 5. Varieties; 6. Tori, LUC and XTR; 7. Curves and divisor class groups; 8. Rational maps on curves and divisors; 9. Elliptic curves; 10. Hyperelliptic curves; Part III. Exponentiation, Factoring and Discrete Logarithms: 11. Basic algorithms for algebraic groups; 12. Primality testing and integer factorisation using algebraic groups; 13. Basic discrete logarithm algorithms; 14. Factoring and discrete logarithms using pseudorandom walks; 15. Factoring and discrete logarithms in subexponential time; Part IV. Lattices: 16. Lattices; 17. Lattice basis reduction; 18. Algorithms for the closest and shortest vector problems; 19. Coppersmith's method and related applications; Part V. Cryptography Related to Discrete Logarithms: 20. The Diffie?Hellman problem and cryptographic applications; 21. The Diffie?Hellman problem; 22. Digital signatures based on discrete logarithms; 23. Public key encryption based on discrete logarithms; Part VI. Cryptography Related to Integer Factorisation: 24. The RSA and Rabin cryptosystems; Part VII. Advanced Topics in Elliptic and Hyperelliptic Curves: 25. Isogenies of elliptic curves; 26. Pairings on elliptic curves; Appendix A. Background mathematics; References; Author index; Subject index.
정보제공 :