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 Explore New Algorithms in Zero-knowledge, Homomorphic Encryption, and Quantum Cryptography

Arrow left icon
Product type Paperback
Published in Aug 2024
Publisher Packt
ISBN-13 9781835080030
Length 410 pages
Edition 2nd Edition
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 (17) Chapters Close

Preface 1. Section 1: A Brief History and Outline of Cryptography FREE CHAPTER
2. Deep Dive into Cryptography 3. Section 2: Classical Cryptography (Symmetric and Asymmetric Encryption)
4. Symmetric Encryption Algorithms 5. Asymmetric Encryption Algorithms 6. Hash Functions and Digital Signatures 7. Section 3: New Cryptography Algorithms and Protocols
8. Zero-Knowledge Protocols 9. New Inventions in Cryptography and Logical Attacks 10. Elliptic Curves 11. Homomorphic Encryption and Crypto Search Engine 12. Section 4: Quantum Cryptography
13. Quantum Cryptography 14. Quantum Search Algorithms and Quantum Computing 15. Other Books You May Enjoy
16. Index

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:

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:

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: y2 = x3 + 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:

When (y = 0), we can see that, geometrically, the curve intersects the x axis at the point corresponding to ...

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 €18.99/month. Cancel anytime