Summary
In this chapter, we have covered the basic definitions of cryptography; we have refreshed our knowledge of the binary system and ASCII code, and we also explored prime numbers, Fermat's equations, and modular mathematics. Then, we had an overview of classical cryptographic algorithms such as Caesar, Beale, and Vernam.
Finally, in the last section, we analyzed security in a philosophical and technical way, distinguishing the grade of security in cryptography in relation to the grade of complexity.
In the next chapter, we will explore symmetric encryption, where we deep dive into algorithms such as the Data Encryption Standard (DES) and Advanced Encryption Standard (AES) families, and also address some of the issues mentioned in this chapter.
