Mathematics of Public Key Cryptography
£56.99
- Author: Steven D. Galbraith, University of Auckland
- Date Published: March 2012
- availability: Available
- format: Hardback
- isbn: 9781107013926
£
56.99
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- Mathematical background and cryptographic applications are covered in one book
- Based on student feedback from author's classroom experience
- Open problems point the reader towards potential areas of future research
Reviews & endorsements
'… the book gathers the main mathematical topics related to public key cryptography and provides an excellent source of information for both students and researchers interested in the field.' Juan Tena Ayuso, Zentralblatt MATH
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: March 2012
- format: Hardback
- isbn: 9781107013926
- length: 630 pages
- dimensions: 254 x 178 x 35 mm
- weight: 1.28kg
- contains: 11 b/w illus. 750 exercises
- availability: Available
Table of Contents
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.-
General Resources
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact lecturers@cambridge.org.
Instructors have used or reviewed this title for the following courses
- Cryptology
- Mathematics of Cryptography
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×