Overview
- Traces the history of the conflict between cryptographer and cryptanalyst
- Explores in some depth the algorithms created to protect messages
- Suggests where the field of cryptology is going in the future
Part of the book series: SpringerBriefs in Computer Science (BRIEFSCOMPUTER)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
The science of cryptology is made up of two halves. Cryptography is the study of how to create secure systems for communications. Cryptanalysis is the study of how to break those systems. The conflict between these two halves of cryptology is the story of secret writing. For over 2,000 years, the desire to communicate securely and secretly has resulted in the creation of numerous and increasingly complicated systems to protect one's messages. Yet for every system there is a cryptanalyst creating a new technique to break that system. With the advent of computers the cryptographer seems to finally have the upper hand. New mathematically based cryptographic algorithms that use computers for encryption and decryption are so secure that brute-force techniques seem to be the only way to break them – so far. This work traces the history of the conflict between cryptographer and cryptanalyst, explores in some depth the algorithms created to protect messages, and suggests where the field is going in the future.
Similar content being viewed by others
Keywords
Table of contents (9 chapters)
-
Front Matter
-
Back Matter
Reviews
From the reviews:
“The primary value of the work is for those interested in the development of DES and AES, or for those working on the key exchange issue, which lies at the heart of the RSA algorithm. It will also be useful for readers who might want to use it as a text in computer security courses, especially since that is how the author intended it in the first place.” (G. Mick Smith, Computer Reviews, March, 2014)Authors and Affiliations
Bibliographic Information
Book Title: A Brief History of Cryptology and Cryptographic Algorithms
Authors: John F. Dooley
Series Title: SpringerBriefs in Computer Science
DOI: https://doi.org/10.1007/978-3-319-01628-3
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Author(s) 2013
Softcover ISBN: 978-3-319-01627-6Published: 15 October 2013
eBook ISBN: 978-3-319-01628-3Published: 24 September 2013
Series ISSN: 2191-5768
Series E-ISSN: 2191-5776
Edition Number: 1
Number of Pages: XII, 99
Number of Illustrations: 33 b/w illustrations
Topics: History of Computing, Data Structures and Information Theory, History of Science