liveBook · Manning

Group order

The order of a finite group is the number of elements it contains.

How 2 Manning books explain it

Elliptic Curve Cryptography for Developers

Elliptic curve cardinality is the number of points on an elliptic curve over a specified finite field, including the point at infinity.

How it is used
Guides selection of elliptic curves and base points with secure prime-order subgroups.
How deep it goes
Derives cardinality bounds and gives PARI/gp-based counting, factoring, and acceptance procedures without deriving point-counting algorithms.
Examples
Uses curves over p=1187 and p=43 to inspect cardinality, generators, and point orders.
What you can do after
Apply it via PARI/gp to count curve points, factor cardinalities, and select suitable prime-order subgroups.

Read how Elliptic Curve Cryptography for Developers explains group order →

Real-World Cryptography

The order of a finite group is the number of elements it contains.

How it is used
Uses group order to explain modular exponentiation, RSA decryption, and subgroup structure in Diffie–Hellman.
How deep it goes
Defines order, illustrates subgroup sizes, and applies p − 1 and modular inverses, without developing formal proofs.
Examples
Uses the subgroup {1, 4} modulo 5 and RSA’s prime-modulus order p − 1.
What you can do after
Evaluate/understand how group size determines modular exponentiation cycles and supports RSA private-exponent calculation.

Read how Real-World Cryptography explains group order →

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.