Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Cryptography Algorithms

You're reading from   Cryptography Algorithms A guide to algorithms in blockchain, quantum cryptography, zero-knowledge protocols, and homomorphic encryption

Arrow left icon
Product type Paperback
Published in Mar 2022
Publisher Packt
ISBN-13 9781789617139
Length 358 pages
Edition 1st Edition
Languages
Concepts
Arrow right icon
Author (1):
Arrow left icon
Massimo Bertaccini Massimo Bertaccini
Author Profile Icon Massimo Bertaccini
Massimo Bertaccini
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Section 1: A Brief History and Outline of Cryptography
2. Chapter 1: Deep Diving into Cryptography FREE CHAPTER 3. Section 2: Classical Cryptography (Symmetric and Asymmetric Encryption)
4. Chapter 2: Introduction to Symmetric Encryption 5. Chapter 3: Asymmetric Encryption 6. Chapter 4: Introducing Hash Functions and Digital Signatures 7. Section 3: New Cryptography Algorithms and Protocols
8. Chapter 5: Introduction to Zero-Knowledge Protocols 9. Chapter 6: New Algorithms in Public/Private Key Cryptography 10. Chapter 7: Elliptic Curves 11. Chapter 8: Quantum Cryptography 12. Section 4: Homomorphic Encryption and the Crypto Search Engine
13. Chapter 9: Crypto Search Engine 14. Other Books You May Enjoy

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...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime