math concept
9 topics use this
Math concept
Group Theory
Core equation
$$G = \langle g \rangle, \quad |G| = n$$
A group is a set with an associative binary operation, an identity, and inverses. Group theory classifies symmetries and is central to cryptography, quantum computing, chemistry (molecular symmetry), and physics (gauge theories).
Definition and examples
A group $(G, \cdot)$ satisfies: closure, associativity, identity $e$, and inverses.
Key examples:
- $(\mathbb{Z}, +)$: integers under addition (infinite cyclic)
- $\mathbb{Z}_n$: integers mod $n$ under addition (finite cyclic, order $n$)
- $\mathbb{Z}_p^*$: multiplicative group mod prime $p$ (cyclic, order $p-1$)
- Elliptic curve groups: abelian, used in ECC
Lagrange’s theorem
| For a finite group $G$ and subgroup $H$: $ | H | $ divides $ | G | $. The order of any element $g$ divides $ | G | $. |
Cyclic groups and generators
A group is cyclic if there exists $g \in G$ with $G = {e, g, g^2, \ldots}$. The discrete logarithm problem asks: given $g^x$, find $x$. This is hard in well-chosen groups, providing the security of most public-key cryptography.
Applications in quantum computing
Quantum algorithms exploit group structure — Shor’s algorithm reduces factoring to period-finding in $\mathbb{Z}$, which is solved efficiently via the quantum Fourier transform over $\mathbb{Z}_N$.
Fields that use this concept
Engineering & CS
Cryptography
AES Block Cipher
The Advanced Encryption Standard, a symmetric block cipher operating on 128-bit blocks with Galois field arithmetic.
Commitment Schemes
Cryptographic primitives allowing a party to commit to a value while keeping it hidden, and later reveal it with a binding guarantee.
Diffie-Hellman Key Exchange
A protocol enabling two parties to establish a shared secret over an insecure channel using discrete logarithms.
Digital Signatures
Cryptographic schemes binding a message to a signer's identity, providing authentication, integrity, and non-repudiation.
Elliptic Curve Cryptography
Public-key cryptography built on the algebraic structure of elliptic curves over finite fields.
RSA Cryptosystem
A public-key cryptosystem based on the computational hardness of factoring large integers.
Zero-Knowledge Proofs
Interactive or non-interactive protocols enabling a prover to convince a verifier of a statement's truth without revealing any additional information.
Physical sciences
Quantum computing