Elliptic-curve cryptography

As explained in Real-World Cryptography

Elliptic curve cryptography is public-key cryptography based on the algebraic structure of elliptic curves over finite fields.

Elliptic curve cryptography builds public-key cryptography from groups formed by points on elliptic curves. Its practical appeal is smaller keys: about 256-bit parameters can provide an alternative to 2,048-bit Diffie-Hellman parameters. section 5.3

The underlying idea has three useful layers:

• Define a curve, commonly with the short Weierstrass equation y² = x³ + ax + b, subject to a non-degeneracy condition. section 5.3.1
• Treat curve points as an additive group, using geometric rules for point addition. section 5.3.1
• Run Diffie-Hellman over that group to obtain elliptic-curve Diffie-Hellman key exchange. section 5.3 section 5.3.1
• For two distinct points, draw their connecting line, find its third curve intersection, and reflect it; use a tangent for doubling and the point at infinity for cancellation cases. section 5.3.1

Figure 5.9 An addition operation can be defined over points of an elliptic curve by using geometry.

Visualize elliptic-curve point addition as a geometric construction. section 5.3.1

Figure 5.11 Elliptic curve cryptography (ECC), in practice, is mostly specified with elliptic curves in coordinates modulo a large prime number p. This means that what we use in cryptography looks much more like the right graph than the left graph.

Compare ordinary curve geometry with cryptographic curves represented in coordinates modulo a large prime. section 5.3.1

How Real-World Cryptography covers it

How deep it goes

Explains curve equations, additive groups, geometric point addition, modular coordinates, and standard curves without implementation details.

Examples

Uses geometric point-addition diagrams and identifies P-256 and Curve25519 as widely used curves.

What it assumes

Builds on Diffie-Hellman groups while introducing elliptic-curve group operations and notation.

What you can do after

Evaluate/understand how ECDH derives from elliptic-curve groups and why it achieves smaller parameters.

How it connects

Connects elliptic curves with Diffie-Hellman, ECDH, finite fields, public-key cryptography, and digital signatures.

liveBookmanning.com

Read Real-World Cryptography on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Software Security for DevelopersElliptic-curve cryptography is public-key cryptography based on the algebraic structure of elliptic curves over finite fields.
• 

  liveBookmanning.com
  Elliptic Curve Cryptography for DevelopersElliptic curve cryptography is public-key cryptography based on algebraic operations over elliptic curves.

Compare how 3 books explain elliptic-curve cryptography →

Related concepts

• elliptic curveuses · An elliptic curve is a nonsingular algebraic curve defined by a cubic equation whose points, including a point at infinity, support a group operation.
• finite fielduses · A finite field is a field containing finitely many elements, with addition, subtraction, multiplication, and division by nonzero elements defined within it.
• discrete logarithmuses · A discrete logarithm is an exponent or scalar that relates a specified group element to a base or generator under the group operation.
• RSAalternative to · RSA is a public-key cryptosystem based on the computational difficulty of factoring large composite integers and supporting encryption and digital signatures.
• ECDSAused by · ECDSA is a public-key digital signature algorithm that uses elliptic-curve arithmetic to generate and verify signatures.
• cryptographic keyproduces · A cryptographic key is a value supplied to a cryptographic algorithm to control operations such as encryption, decryption, signing, authentication, or verification.

This explainer was generated by Manning's knowledge graph from the text of Real-World Cryptography. The section links point to the parts of the book it draws on.