Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Mathematics of Public Key Cryptography

$79.99 (P)

  • Date Published: April 2012
  • availability: In stock
  • format: Hardback
  • isbn: 9781107013926

$ 79.99 (P)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • 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
    Read more

    Reviews & endorsements

    ".. the reader is assumed to have a minimum background in group theory, algorithms and complexity, together with a basic knowledge of abstract algebra that includes ring and field theory. The book is suitable in principle for PhD. students in mathematics and related areas."
    -Mathematical Reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 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: In stock
  • 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.

  • Resources for

    Mathematics of Public Key Cryptography

    Steven D. Galbraith

    General Resources

    Welcome to the resources site

    Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.


    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email lecturers@cambridge.org

  • Instructors have used or reviewed this title for the following courses

    • Cryptology
    • Mathematics of Cryptography
  • Author

    Steven D. Galbraith, University of Auckland
    Steven D. Galbraith is a leading international authority on the mathematics of public key cryptography. He is an Associate Professor in the Department of Mathematics at the University of Auckland.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

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
Please note that this file is password protected. You will be asked to input your password on the next screen.

» 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 ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.

×
Please fill in the required fields in your feedback submission.
×