liveBook · Manning

ECDSA

Also called Elliptic Curve Digital Signature Algorithm

ECDSA is a public-key digital signature algorithm that uses elliptic-curve arithmetic to generate and verify signatures.

How 3 Manning books explain it

Hacking Cryptography

ECDSA is an elliptic-curve digital signature algorithm that generates and verifies signatures using elliptic-curve group operations.

How it is used
Authenticates authorized code and messages through elliptic-curve digital signatures.
How deep it goes
Explains key generation, signing, verification, nonce-reuse exploitation, and defensive randomness practice, while deferring verification proof details.
Examples
Uses PlayStation 3 code signing, vulnerable Go implementations, repeated-r test outputs, and signatures over SHA-256-hashed messages.
What you can do after
Build it from scratch, verify signatures with Go, and diagnose private-key compromise caused by reused nonces.

Read how Hacking Cryptography explains ECDSA →

Real-World Cryptography

ECDSA is an elliptic-curve digital signature algorithm that generates and verifies signatures using elliptic-curve arithmetic.

How it is used
Deploys ECDSA as a widely adopted elliptic-curve scheme for generating and verifying digital signatures.
How deep it goes
Explains key generation, signing inputs, signature formulas, and verification inputs, but does not provide a complete verification derivation.
Examples
Uses the [x]G public-key formula, r-and-s signature calculation, and ECDSA with NIST’s P-256 curve.
What you can do after
Evaluate/understand ECDSA key generation, signing inputs, signature values, interoperability requirements, and misuse warnings.

Read how Real-World Cryptography explains ECDSA →

Elliptic Curve Cryptography for Developers

The Elliptic Curve Digital Signature Algorithm, a public-key signature scheme that generates and verifies signatures using elliptic-curve group operations and message hashes.

How it is used
Deploys ECDSA to create authorship proofs for digital documents and verify them with public keys.
How deep it goes
Derives signing and verification equations, maps them to subroutines, and omits many details of the NIST standard.
Examples
Uses C-style signing and verification routines tested against example curves, pass phrases, and a shared message buffer.
What you can do after
Build it from scratch by implementing signature structures, signing and verification routines, modular arithmetic, and point operations.

Read how Elliptic Curve Cryptography for Developers explains ECDSA →

Also covered in

What to know first

Related concepts

Questions about ECDSA

What is ECDSA?

ECDSA is a public-key digital signature algorithm that uses elliptic-curve arithmetic to generate and verify signatures.

Which Manning books explain ECDSA?

Hacking Cryptography, Real-World Cryptography and Elliptic Curve Cryptography for Developers.

What should I know before learning ECDSA?

Manning books that teach ECDSA usually introduce digital signature, elliptic curve, private key and base point first.

What is the difference between ECDSA and EdDSA?

ECDSA is a public-key digital signature algorithm that uses elliptic-curve arithmetic to generate and verify signatures. EdDSA is a deterministic public-key digital signature scheme based on Edwards-curve elliptic-curve cryptography.

What is ECDSA also called?

ECDSA is also called Elliptic Curve Digital Signature Algorithm.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.