Cryptological Mathematics
£30.99
Part of Mathematical Association of America Textbooks
- Author: Robert Edward Lewand, Goucher College, Baltimore
- Date Published: December 2000
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Mathematical Association of America for availability.
- format: Paperback
- isbn: 9780883857199
£
30.99
Paperback
Looking for an inspection copy?
This title is not currently available on inspection
-
This is an introduction to the mathematics involved in the intriguing field of cryptology, the science of writing and reading secret messages which are designed to be read only by their intended recipients. It is written at an elementary level, suitable for beginning undergraduates, with careful explanations of all the concepts used. The basic branches of mathematics required, including number theory, abstract algebra and probability, are used to show how to encipher and decipher messages, and why this works, giving a practical as well as theoretical basis to the subject. Challenging computer programming exercises are also included. The book is written in an engaging style which will appeal to all, and also includes historical background on some of the founders of the subject. It will be of interest both to students wishing to learn cryptology per se, and also to those searching for practical applications of seemingly abstract mathematics.
Read more- Explains the elementary mathematics behind cryptology (code-making and -breaking)
- Interesting application of elementary mathematics
- Written in an engaging style
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: December 2000
- format: Paperback
- isbn: 9780883857199
- length: 211 pages
- dimensions: 255 x 178 x 23 mm
- weight: 0.375kg
- availability: This item is not supplied by Cambridge University Press in your region. Please contact Mathematical Association of America for availability.
Table of Contents
Preface
1. Monoalphabetic substitution ciphers
2. Polyalphabetic substitution ciphers
3. Polygraphic substitution ciphers
4. Public key cryptography
Appendices.-
Resources for
Cryptological Mathematics
Robert Edward Lewand
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.
Related Books
related journals
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.
×