Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Look Inside A Computational Introduction to Number Theory and Algebra

A Computational Introduction to Number Theory and Algebra

2nd Edition

$82.00 (P)

  • Date Published: February 2009
  • availability: Available
  • format: Hardback
  • isbn: 9780521516440

$ 82.00 (P)
Hardback

Add to cart Add to wishlist

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
  • This introductory book emphasizes algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The presentation alternates between theory and applications in order to motivate and illustrate the mathematics. The mathematical coverage includes the basics of number theory, abstract algebra and discrete probability theory. This edition now includes over 150 new exercises, ranging from the routine to the challenging, that flesh out the material presented in the body of the text, and which further develop the theory and present new applications. The material has also been reorganized to improve clarity of exposition and presentation. Ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students.

    • Now contains over 650 exercises, which present new applications to number theory and algebra
    • Minimal mathematics needed
    • An ideal textbook for an introductory graduate or advanced undergraduate course, geared towards computer science students
    Read more

    Reviews & endorsements

    "The subject matter is presented in a very thorough way. Detailed and clear proofs are given for (almost) all results. The material is very well organized: definitions, results, and their interrelations fit together perfectly. The book is especially attractive to students with a background or interest in computer science. On the other hand, students who already have a background in abstract algebra can benefit greatly from this book by skipping some parts where algebraic theory is introduced. The suitability of the book for self-study is greatly enhanced by a wealth of exercises and examples that are provided. Last but not least, the book is very well-written, and it is a pleasure to read.
    Gregor Kemper, Mathematics of Computation

    "It’s a pleasure to find a book that is so masterful and so well written that it has all the hallmarks of a classic. This is such a book.This is a truly magnificent text, deserving of a place on the shelves of any mathematician or computer scientist working in these areas."
    Alasdair McAndrew, Computing Reviews

    See more 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

    • Edition: 2nd Edition
    • Date Published: February 2009
    • format: Hardback
    • isbn: 9780521516440
    • length: 600 pages
    • dimensions: 244 x 170 x 33 mm
    • weight: 1.15kg
    • contains: 650 exercises
    • availability: Available
  • Table of Contents

    Preface
    Preliminaries
    1. Basic properties of the integers
    2. Congruences
    3. Computing with large integers
    4. Euclid's algorithm
    5. The distribution of primes
    6. Abelian groups
    7. Rings
    8. Finite and discrete probability distributions
    9. Probabilistic algorithms
    10. Probabilistic primality testing
    11. Finding generators and discrete logarithms in Z*p
    12. Quadratic reciprocity and computing modular square roots
    13. Modules and vector spaces
    14. Matrices
    15. Subexponential-time discrete logarithms and factoring
    16. More rings
    17. Polynomial arithmetic and applications
    18. Linearly generated sequences and applications
    19. Finite fields
    20. Algorithms for finite fields
    21. Deterministic primality testing
    Appendix: some useful facts
    Bibliography
    Index of notation
    Index.

  • Resources for

    A Computational Introduction to Number Theory and Algebra

    Victor Shoup

    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

  • Author

    Victor Shoup, New York University
    Victor Shoup is a Professor in the Department of Computer Science at the Courant Institute of Mathematical Sciences, New York University.

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

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