Chapter 1: Deep Diving into Cryptography
This chapter provides an introduction to cryptography, what it is needed for, and why it is so important in IT. This chapter also gives a panoramic view of the principal algorithms from the history of cryptography, from the Caesar algorithm to the Vernam cipher and other lesser-known algorithms, such as the Beale cipher. Then, Rivest-Shamir-Adleman (RSA), Diffie–Hellman, and other famous algorithms will be described in detail in the proceeding part of this book. Finally, this chapter will give you the instruments to learn cryptography and the pillars of security conservation.
In this chapter, we will cover the following topics:
- A brief introduction to cryptography
- Basic definitions and principal mathematical notations used in the book
- Binary conversion and ASCII code
- Fermat Last's Theorem, prime numbers, and modular mathematics
- The history of the principal cryptographic algorithms and an explanation of some of them (Rosetta cipher, Caesar, ROT13, Beale, Vernam)
- Security notation (semantic, provable, OTP, and so on)
