A Brief History Of Cryptology And Cryptographic Algorithms

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.

This accessible textbook presents a fascinating review of cryptography and cryptanalysis across history. The text relates the earliest use of the monoalphabetic cipher in the ancient world, the development of the “unbreakable” Vigenère cipher, and an account of how cryptology entered the arsenal of military intelligence during the American Revolutionary War. Moving on to the American Civil War, the book explains how the Union solved the Vigenère ciphers used by the Confederates, before investigating the development of cipher machines throughout World War I and II. This is then followed by an exploration of cryptology in the computer age, from public-key cryptography and web security, to criminal cyber-attacks and cyber-warfare. Looking to the future, the role of cryptography in the Internet of Things is also discussed, along with the potential impact of quantum computing. Topics and features: presents a history of cryptology from ancient Rome to the present day, with a focus on cryptology in the 20th and 21st centuries; reviews the different types of cryptographic algorithms used to create secret messages, and the various methods for breaking such secret messages; provides engaging examples throughout the book illustrating the use of cryptographic algorithms in different historical periods; describes the notable contributions to cryptology of Herbert Yardley, William and Elizebeth Smith Friedman, Lester Hill, Agnes Meyer Driscoll, and Claude Shannon; concludes with a review of tantalizing unsolved mysteries in cryptology, such as the Voynich Manuscript, the Beale Ciphers, and the Kryptos sculpture. This engaging work is ideal as both a primary text for courses on the history of cryptology, and as a supplementary text for advanced undergraduate courses on computer security. No prior background in mathematics is assumed, beyond what would be encountered in an introductory course on discrete mathematics.

This accessible textbook presents a fascinating review of cryptography and cryptanalysis across history. The text relates the earliest use of the monoalphabetic cipher in the ancient world, the development of the "unbreakable" Vigenère cipher, and an account of how cryptology entered the arsenal of military intelligence during the American Revolutionary War. Moving on to the American Civil War, the book explains how the Union solved the Vigenère ciphers used by the Confederates, before investigating the development of cipher machines throughout World War I and II. This is then followed by an exploration of cryptology in the computer age, from public-key cryptography and web security, to criminal cyber-attacks and cyber-warfare. Looking to the future, the role of cryptography in the Internet of Things is also discussed, along with the potential impact of quantum computing. Topics and features: Presents a history of cryptology from ancient Rome to the present day, with a focus on cryptology in the 20th and 21st centuries Reviews the different types of cryptographic algorithms used to create secret messages, and the various methods for breaking such secret messages Provides engaging examples throughout the book illustrating the use of cryptographic algorithms in different historical periods Describes the notable contributions to cryptology of Herbert Yardley, William and Elizebeth Smith Friedman, Lester Hill, Agnes Meyer Driscoll, and Claude Shannon Concludes with a review of tantalizing unsolved mysteries in cryptology, such as the Voynich Manuscript, the Beale Ciphers, and the Kryptos sculpture This engaging work is ideal as both a primary text for courses on the history of cryptology, and as a supplementary text for advanced undergraduate courses on computer security. No prior background in mathematics is assumed, beyond what would be encountered in an introductory course on discrete mathematics. John F. Dooley is the William and Marilyn Ingersoll Professor Emeritus of Computer Science at Knox College in Galesburg, Illinois. Before returning to teaching in 2001, he spent more than 15 years in the software industry as a developer, designer, and manager working for companies such as Bell Telephone Laboratories, McDonnell Douglas, IBM, and Motorola. His other publications include the popular Springer title Codes, Ciphers and Spies: Tales of Military Intelligence in World War I.

"Boone identifies milestone accomplishments and activities in the three fields to provide an introduction to the talented people who have led developments and applications. Illustrations are included to give a feel for pieces of equipment and systems, but the book's focus is on brainpower, an ingredient essential for success in cryptology."--BOOK JACKET.

The first edition of this award-winning book attracted a wide audience. This second edition is both a joy to read and a useful classroom tool. Unlike traditional textbooks, it requires no mathematical prerequisites and can be read around the mathematics presented. If used as a textbook, the mathematics can be prioritized, with a book both students and instructors will enjoy reading. Secret History: The Story of Cryptology, Second Edition incorporates new material concerning various eras in the long history of cryptology. Much has happened concerning the political aspects of cryptology since the first edition appeared. The still unfolding story is updated here. The first edition of this book contained chapters devoted to the cracking of German and Japanese systems during World War II. Now the other side of this cipher war is also told, that is, how the United States was able to come up with systems that were never broken. The text is in two parts. Part I presents classic cryptology from ancient times through World War II. Part II examines modern computer cryptology. With numerous real-world examples and extensive references, the author skillfully balances the history with mathematical details, providing readers with a sound foundation in this dynamic field. FEATURES Presents a chronological development of key concepts Includes the Vigenère cipher, the one-time pad, transposition ciphers, Jefferson’s wheel cipher, Playfair cipher, ADFGX, matrix encryption, Enigma, Purple, and other classic methods Looks at the work of Claude Shannon, the origin of the National Security Agency, elliptic curve cryptography, the Data Encryption Standard, the Advanced Encryption Standard, public-key cryptography, and many other topics New chapters detail SIGABA and SIGSALY, successful systems used during World War II for text and speech, respectively Includes quantum cryptography and the impact of quantum computers

From the world's most renowned security technologist, Bruce Schneier, this 20th Anniversary Edition is the most definitive reference on cryptography ever published and is the seminal work on cryptography. Cryptographic techniques have applications far beyond the obvious uses of encoding and decoding information. For developers who need to know about capabilities, such as digital signatures, that depend on cryptographic techniques, there's no better overview than Applied Cryptography, the definitive book on the subject. Bruce Schneier covers general classes of cryptographic protocols and then specific techniques, detailing the inner workings of real-world cryptographic algorithms including the Data Encryption Standard and RSA public-key cryptosystems. The book includes source-code listings and extensive advice on the practical aspects of cryptography implementation, such as the importance of generating truly random numbers and of keeping keys secure. ". . .the best introduction to cryptography I've ever seen. . . .The book the National Security Agency wanted never to be published. . . ." -Wired Magazine ". . .monumental . . . fascinating . . . comprehensive . . . the definitive work on cryptography for computer programmers . . ." -Dr. Dobb's Journal ". . .easily ranks as one of the most authoritative in its field." -PC Magazine The book details how programmers and electronic communications professionals can use cryptography-the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. The book shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. With a new Introduction by the author, this premium edition will be a keepsake for all those committed to computer and cyber security.

Build your real-world cryptography knowledge, from understanding the fundamentals to implementing the most popular modern-day algorithms to excel in your cybersecurity career Key FeaturesLearn modern algorithms such as zero-knowledge, elliptic curves, and quantum cryptographyExplore vulnerability and new logical attacks on the most-used algorithmsUnderstand the practical implementation of algorithms and protocols in cybersecurity applicationsBook Description Cryptography Algorithms is designed to help you get up and running with modern cryptography algorithms. You'll not only explore old and modern security practices but also discover practical examples of implementing them effectively. The book starts with an overview of cryptography, exploring key concepts including popular classical symmetric and asymmetric algorithms, protocol standards, and more. You'll also cover everything from building crypto codes to breaking them. In addition to this, the book will help you to understand the difference between various types of digital signatures. As you advance, you will become well-versed with the new-age cryptography algorithms and protocols such as public and private key cryptography, zero-knowledge protocols, elliptic curves, quantum cryptography, and homomorphic encryption. Finally, you'll be able to apply the knowledge you've gained with the help of practical examples and use cases. By the end of this cryptography book, you will be well-versed with modern cryptography and be able to effectively apply it to security applications. What you will learnUnderstand key cryptography concepts, algorithms, protocols, and standardsBreak some of the most popular cryptographic algorithmsBuild and implement algorithms efficientlyGain insights into new methods of attack on RSA and asymmetric encryptionExplore new schemes and protocols for blockchain and cryptocurrencyDiscover pioneering quantum cryptography algorithmsPerform attacks on zero-knowledge protocol and elliptic curvesExplore new algorithms invented by the author in the field of asymmetric, zero-knowledge, and cryptocurrencyWho this book is for This hands-on cryptography book is for IT professionals, cybersecurity enthusiasts, or anyone who wants to develop their skills in modern cryptography and build a successful cybersecurity career. Working knowledge of beginner-level algebra and finite fields theory is required.

The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated Lenstra-Lenstra-Lovász lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards.