A Brief History of Cryptology and Cryptographic Algorithms

Nonfiction, Computers, Advanced Computing, Theory, General Computing, Reference
Cover of the book A Brief History of Cryptology and Cryptographic Algorithms by John Dooley, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: John Dooley ISBN: 9783319016283
Publisher: Springer International Publishing Publication: September 24, 2013
Imprint: Springer Language: English
Author: John Dooley
ISBN: 9783319016283
Publisher: Springer International Publishing
Publication: September 24, 2013
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Strong and Weak Approximation of Semilinear Stochastic Evolution Equations by John Dooley
Cover of the book Lost Circulation and Wellbore Strengthening by John Dooley
Cover of the book Mathematical Problems in Meteorological Modelling by John Dooley
Cover of the book Advances in Robot Kinematics 2016 by John Dooley
Cover of the book Dynamics of Big Internet Industry Groups and Future Trends by John Dooley
Cover of the book Policy Capacity and Governance by John Dooley
Cover of the book Behind the Frontiers of the Real by John Dooley
Cover of the book Contemporary Issues in Geoenvironmental Engineering by John Dooley
Cover of the book Dynamics of Coupled Structures, Volume 4 by John Dooley
Cover of the book Foundational and Practical Aspects of Resource Analysis by John Dooley
Cover of the book Population Genetics and Belonging by John Dooley
Cover of the book Seafarers’ Rights in China by John Dooley
Cover of the book Leading Global Innovation by John Dooley
Cover of the book Reassessing the Role of Management in the Golden Age by John Dooley
Cover of the book Quantum Mathematical Physics by John Dooley
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy