Book Image

Cryptography Algorithms

By : Massimo Bertaccini
Book Image

Cryptography Algorithms

By: Massimo Bertaccini

Overview of this book

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.
Table of Contents (15 chapters)
1
Section 1: A Brief History and Outline of Cryptography
3
Section 2: Classical Cryptography (Symmetric and Asymmetric Encryption)
7
Section 3: New Cryptography Algorithms and Protocols
12
Section 4: Homomorphic Encryption and the Crypto Search Engine

Introduction to CSE – homomorphism

The genesis of CSE dates back to 2014 when I was struggling for several months with a new method of factorization. You can understand that the factorization problem and search in blind are strictly related to each other. Both these problems, factorization and searching among big data, have similar complexity.

Moreover, both these problems have their domain inside P=NP, meaning some problems are easy to solve (P) while others are very hard to solve (NP) even if they are supposed to get a very high or infinite level of computation.

Most scientists and data science engineers are convinced that P≠NP or all NP problems are intrinsically complex and cannot be solved with a polynomial algorithm. I don't think so; I am more interested in finding solutions to complicated problems as opposed to saying that solutions don't exist. I am also convinced that there are different ways to obtain a solution. For example, Fermat's...