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

Operations on elliptic curves

The first observation is that an elliptic curve is not an ellipse. The general mathematical form of an elliptic curve is as follows:

E: y^2 = x^3 + ax^2 + bx + c

Important Note

E: represents the form of the elliptic curve, and the parameters (a, b, and c) are coefficients of the curve.

Just to give evidence of what we are discussing, we'll try to plot the following curve:

E: y2 = x3 + 73

As we can see in the following figure, I have plotted this elliptic curve with WolframAlpha represented in its geometric form:

Figure 7.1 – Elliptic curve: E: y^2 = x^3 + 73

We can start to analyze geometrically and algebraically how these curves work and their prerogatives. Since they are not linear, they are easy to implement for cryptographic scopes, making them adaptable.

For example, let's take the curve plotted previously:

E : y^2 = x^3 + 73

When (y = 0), we can see that, geometrically, the curve...