Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
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

A numerical exercise on a digital signature on secp256k1

In this section, we will deep dive into the digital signature of secp256k1 in order to understand the mechanism behind the operations of implementation and validation of the digital signature.

Suppose, for instance, that the parameters of the curve are the following:

So, as we have chosen a very simple private key, it is just enough to perform a double point to obtain the public key (Q):

In this case, we proceed to calculate the public key (Q). First, we will use the following formula to calculate the double point:

Calculating Q = d * G using numbers implies replacing [d] and (G) with numbers:

Relying on the formula of the double point, let’s find the coordinates of Q (x and y), starting with x:

In the same way, let’s find the y coordinate of yQ:

So the coordinates of the public key (Q) are as...

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