liveBook · Manning

Elliptic-curve point

An elliptic-curve point is a solution to an elliptic-curve equation over a specified field, participating in the curve's group operation.

How 2 Manning books explain it

Hacking Cryptography

An elliptic-curve point is a coordinate pair satisfying the equation of an elliptic curve and participating in its group operation.

How it is used
Supports generator-point operations and state recovery in the DUAL_EC_DRBG backdoor attack.
How deep it goes
Explains curve membership, modular square roots, coordinate validation, truncation recovery, and scalar multiplication, but not point-addition internals.
Examples
Uses P-256 validation, truncated output reconstruction, Go implementations, and a test that clones 100 subsequent outputs.
What you can do after
Diagnose/debug point reconstruction by validating coordinates and testing scalar-multiplication candidates against observed outputs.

Read how Hacking Cryptography explains elliptic-curve point →

Elliptic Curve Cryptography for Developers

An elliptic curve point is a solution point of an elliptic curve equation over a specified field.

How it is used
Supports elliptic-curve algebra and cryptographic operations over finite fields and field extensions.
How deep it goes
Descends from geometric intuition to point structures, addition, multiplication, infinity handling, embedding, and random-point routines.
Examples
Uses the curve y² = x³ − 5x + 5, subgroup factorization, Schnorr verification, and polynomial random-point generation.
What you can do after
Implement point addition, multiplication, identity handling, random generation, and coordinate-based Schnorr verification.

Read how Elliptic Curve Cryptography for Developers explains elliptic-curve point →

Related concepts

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.