Each table lists a symbol as it is rendered and as you would type it in LaTeX, how to read it aloud, what it means in the articles on this site, a small example, and the chapters that use it most. Vectors, norms and matrices are in 8.2, lattice quantities in 8.3, polynomial rings in 8.4, and sampling in 8.5.

Number systems

SymbolRead asMeaning on this siteExampleUsed in
Z\mathbb{Z}
\mathbb{Z}
“zed” or “the integers”All whole numbers …, −2, −1, 0, 1, 2, …. Lattice points have integer coordinates in a basis, so this is the most common symbol on the site.−3∈Z, 0.5∉Z-3 \in \mathbb{Z},\ 0.5 \notin \mathbb{Z}1.6, 2.3, 2.4, 2.5, 7.5, 1.2
Zn\mathbb{Z}^n
\mathbb{Z}^n
“zed to the n”Vectors of length nn with integer entries. Zn\mathbb{Z}^n is also the simplest lattice, the integer grid.(2,−1,0)∈Z3(2, -1, 0) \in \mathbb{Z}^31.6, 7.5, 6.2, 2.5, 1.2, 2.4
R, Rn\mathbb{R},\ \mathbb{R}^n
\mathbb{R}^n
“the reals”, “R to the n”Real numbers, and real vectors of length nn. A lattice sits inside Rn\mathbb{R}^n; the target point in CVP is usually an arbitrary point of Rn\mathbb{R}^n.(0.5,2)∈R2(0.5, \sqrt{2}) \in \mathbb{R}^21.3, 2.2, 1.6, 1.2, , 3.2
Q, C\mathbb{Q},\ \mathbb{C}
\mathbb{Q},\ \mathbb{C}
“the rationals”, “the complex numbers”Fractions, and complex numbers. They appear rarely: Q(ζ2n)\mathbb{Q}(\zeta_{2n}) for cyclotomic fields, and C\mathbb{C} for the complex embedding used by CKKS and Falcon.355113∈Q\tfrac{355}{113} \in \mathbb{Q}1.6, 3.2, 3.6
Zq\mathbb{Z}_q
\mathbb{Z}_q
“zed mod q” or “zed q”The integers modulo qq: the residues 0,1,…,q−10, 1, \dots, q-1 with addition and multiplication wrapping around at qq. Other books write Z/qZ\mathbb{Z}/q\mathbb{Z}; it is the same object. Zqn\mathbb{Z}_q^n means vectors of length nn with entries in Zq\mathbb{Z}_q.In Z3329\mathbb{Z}_{3329} (ML-KEM): 3000+400=713000 + 400 = 712.3, 2.4, 3.5, 3.3, 3.1, 3.4

Sets and membership

SymbolRead asMeaning on this siteExampleUsed in
∈, ∉\in,\ \notin
\in,\ \notin
“is in”, “is an element of”; “is not in”Membership. v∈Λv \in \Lambda says vv is a lattice point.s∈Zqns \in \mathbb{Z}_q^n3.3, 2.3, 1.6, 2.4, 3.1, 2.6
{ x:P(x) }\{\, x : P(x) \,\}
\{ x : P(x) \}
“the set of x such that P(x)”Set-builder notation. The colon and the vertical bar mean the same thing; both appear on the site, e.g. {Bx∣x∈Zn}\{Bx \mid x \in \mathbb{Z}^n\} in 1.1 and {xB:x∈Zn}\{xB : x \in \mathbb{Z}^n\} in 7.1.{x∈Z:x2<5}={−2,…,2}\{x \in \mathbb{Z} : x^2 < 5\} = \{-2,\dots,2\}1.3, 1.1, 1.2, 1.4, 7.1, 7.5
⊂\subset
\subset
“is a subset of”Every element of the left set is in the right set. Used for a lattice inside Rn\mathbb{R}^n and for sublattices such as Dn⊂ZnD_n \subset \mathbb{Z}^n.Λ⊂Rn\Lambda \subset \mathbb{R}^n1.3, 1.6
∖\setminus
\setminus
“minus”, “without”Set difference. Λ∖{0}\Lambda \setminus \{0\} is every lattice point except the origin, which is how SVP excludes the trivial answer.{1,2,3}∖{2}={1,3}\{1,2,3\} \setminus \{2\} = \{1,3\}2.1, 1.4
∩\cap
\cap
“intersect”Elements in both sets. In 1.3, Λ∩B(0,r)\Lambda \cap B(0, r) is the lattice points inside a ball of radius rr.{1,2,3}∩{2,3,4}={2,3}\{1,2,3\} \cap \{2,3,4\} = \{2,3\}1.3
[a,b], (a,b][a, b],\ (a, b]
(a, b]
“closed interval”, “half-open interval”A square bracket includes the endpoint, a round one excludes it. Also used for integer ranges of coefficients, e.g. [−η,η][-\eta, \eta] in ML-DSA.δ∈(1/4,1]\delta \in (1/4, 1]3.3, 2.5, 1.5, 3.6

Modular arithmetic

Lattice cryptography does almost all of its arithmetic modulo an integer qq: 3329 in ML-KEM, 8380417 in ML-DSA, 12289 in Falcon. Two things trip readers up. First, (modq)\pmod q after an equation and  mod q\bmod q inside an expression look alike but play different roles: one says an equation holds modulo qq, the other computes a remainder. Second, whether a residue is “small” depends on the representative you choose.

SymbolRead asMeaning on this siteExampleUsed in
a≡b(modq)a \equiv b \pmod{q}
a \equiv b \pmod{q}
“a is congruent to b mod q”A statement: qq divides a−ba - b. The parenthesised \pmod form qualifies the whole equation.17≡2(mod5)17 \equiv 2 \pmod{5}2.6, 2.4, 3.3, 1.6, 3.5, 3.1
a mod qa \bmod q
a \bmod q
“a mod q”An operation: the remainder of aa after division by qq, a number in {0,…,q−1}\{0, \dots, q-1\} unless the page says it is centred. Also used for polynomials: f mod (X2−γ)f \bmod (X^2 - \gamma) in 3.5 is the remainder of polynomial division.−3 mod 7=4-3 \bmod 7 = 43.5, 6.4, 3.6, 2.6, 3.3
x mod ±qx \bmod^{\pm} q
\text{centred } x \bmod q
“x mod q, centred”The representative in (−q/2,q/2](-q/2, q/2] instead of [0,q)[0, q). Errors and secrets are small only in this form: 3000 is huge in [0,3329)[0, 3329) but its centred value is −329. Kyber, Dilithium and NTRU all decode by centring first.For q=3329q = 3329: 3000↦−3293000 \mapsto -329, 1665↦−16641665 \mapsto -16642.6, 3.1, 3.3, 2.3
x−1 mod qx^{-1} \bmod q
x^{-1} \bmod q
“the inverse of x mod q”The residue yy with xy≡1(modq)xy \equiv 1 \pmod q. It exists exactly when gcd⁡(x,q)=1\gcd(x, q) = 1.3−1 mod 7=53^{-1} \bmod 7 = 56.4, 2.6, 3.5
gcd⁡(a,b)\gcd(a, b)
\gcd(a, b)
“g-c-d of a and b”Greatest common divisor. In 7.1 it checks that a linear equation has integer solutions for every right-hand side.gcd⁡(271,828,1828)=1\gcd(271, 828, 1828) = 17.1

Rounding and absolute value

SymbolRead asMeaning on this siteExampleUsed in
⌊x⌉\lfloor x \rceil
\lfloor x \rceil
“round x”, “nearest integer to x”Round to the nearest integer, halves rounded up: ⌊x⌉=⌊x+1/2⌋\lfloor x \rceil = \lfloor x + 1/2 \rfloor. Applied to a vector or polynomial it rounds every coordinate. Size reduction in LLL subtracts ⌊μk,j⌉bj\lfloor \mu_{k,j} \rceil b_j.⌊2.5⌉=3, ⌊−2.5⌉=−2, ⌊3329/2⌉=1665\lfloor 2.5 \rceil = 3,\ \lfloor -2.5 \rceil = -2,\ \lfloor 3329/2 \rceil = 16657.2, 3.2, 3.1, 2.3, 2.2, 4.1
⌊x⌋\lfloor x \rfloor
\lfloor x \rfloor
“floor of x”The largest integer not above xx.⌊3329/2⌋=1664, ⌊−2.5⌋=−3\lfloor 3329/2 \rfloor = 1664,\ \lfloor -2.5 \rfloor = -37.3, 3.5, 3.4, 2.3, 3.6
⌈x⌉\lceil x \rceil
\lceil x \rceil
“ceiling of x”The smallest integer not below xx.⌈3329/2⌉=1665, ⌈−2.5⌉=−2\lceil 3329/2 \rceil = 1665,\ \lceil -2.5 \rceil = -27.4
∣x∣, ∣S∣|x|,\ |S|
|x|
“absolute value of x”; “size of S”For a number, its distance from zero. For a set, the number of elements. For a matrix, ∣det⁡(B)∣|\det(B)| is the absolute value of the determinant. Vector lengths use double bars, ∥v∥\|v\|; see 8.2.∣−7∣=7, ∣{0,1}n∣=2n|-7| = 7,\ |\{0, 1\}^n| = 2^n1.2, 7.3, 4.1, 4.6, 2.2

Estimates and growth rates

SymbolRead asMeaning on this siteExampleUsed in
≈\approx
\approx
“approximately equal to”Numerically close. On this site it usually marks an estimate from a model (Gaussian heuristic, BKZ cost), not a bound.δ0≈1.022\delta_0 \approx 1.0221.5, 7.2, 7.4, 3.4, 7.3, 2.1
∼\sim
\sim
“on the order of”; “is distributed as”Two uses. Before a number it means “roughly”, as in ∼229\sim 2^{29}. Between a variable and a distribution it means “sampled from”, as in s∼DΛ,σs \sim D_{\Lambda,\sigma}; see 8.5.∼4×1019\sim 4 \times 10^{19}2.1, 1.5, 4.5
≪, ≫\ll,\ \gg
\ll,\ \gg
“much less than”, “much greater than”Informal: smaller or larger by a wide margin. In LWE, σ≪q\sigma \ll q says the noise is tiny compared with the modulus.σ≪q\sigma \ll q2.2, 2.3, 2.6, 7.3, 2.4, 3.5
≳, ≲\gtrsim,\ \lesssim
\gtrsim,\ \lesssim
“at least about”, “at most about”An inequality that holds up to constants or rounding. Typical use: a threshold found by estimate or experiment, such as N≳2.2×104N \gtrsim 2.2 \times 10^4 in 7.2.β≳50\beta \gtrsim 507.2, 1.3, 2.4, 1.5, 1.4, 6.4
O(f), Θ(f)O(f),\ \Theta(f)
O(f),\ \Theta(f)
“big-O of f”, “theta of f”O(f)O(f): grows at most like ff up to a constant factor. Θ(f)\Theta(f): grows exactly like ff up to constants. Inside an exponent, 2O(n)2^{O(n)} means “exponential in nn” with the constant hidden.O(nlog⁡q), 2Θ(nlog⁡n)O(n \log q),\ 2^{\Theta(n \log n)}2.3, 1.5, 4.3, 3.4, 3.1, 2.1
O~(f)\tilde{O}(f)
\tilde{O}(f)
“soft-O of f”Big-O that also ignores logarithmic factors: O~(n)\tilde{O}(\sqrt{n}) may hide a log⁡n\log n. Common in approximation factors for worst-case reductions.γ=O~(n)\gamma = \tilde{O}(\sqrt{n})2.1, 2.4

Logs, sums, products and logic

SymbolRead asMeaning on this siteExampleUsed in
log⁡, log⁡2, ln⁡\log,\ \log_2,\ \ln
\log,\ \log_2,\ \ln
“log”, “log base 2”, “natural log”log⁡2\log_2 and ln⁡\ln are explicit. A bare log⁡\log appears inside big-O and complexity expressions such as O(nlog⁡q)O(n \log q), where the base only changes a constant. Bit-security figures (“21822^{182} operations”) are base 2.log⁡23329≈11.70, ln⁡3329≈8.11\log_2 3329 \approx 11.70,\ \ln 3329 \approx 8.114.2, 2.3, 1.5, 6.4, 3.4, 1.4
∑i=1n, ∏i=1n\textstyle\sum_{i=1}^{n},\ \prod_{i=1}^{n}
\sum_{i=1}^{n},\ \prod_{i=1}^{n}
“sum over i from 1 to n”, “product over …”Repeated addition and multiplication. The Gram–Schmidt identity det⁡(Λ)=∏i∥b~i∥\det(\Lambda) = \prod_i \|\tilde{b}_i\| is the most frequent product on the site.∑i=14i=10, ∏i=14i=24\textstyle\sum_{i=1}^{4} i = 10,\ \prod_{i=1}^{4} i = 247.2, 1.4, 1.3, 3.5, 1.2, 4.1
n!n!
n!
“n factorial”1⋅2⋯n1 \cdot 2 \cdots n. Appears in Minkowski’s second theorem; Γ(n/2+1)\Gamma(n/2 + 1) in the ball-volume formula generalises it.5!=1205! = 1201.3
  ⟹  ,   ⟺  \implies,\ \iff
\implies,\ \iff
“implies”, “if and only if”Logical consequence and equivalence. Λ(B)=Λ(B′)  ⟺  B′=BU\Lambda(B) = \Lambda(B') \iff B' = BU in 1.2 says the two statements are true together or false together.x=2  ⟹  x2=4x = 2 \implies x^2 = 43.2, 1.2, 7.2, 1.3, 4.5, 4.3
∃, ∀\exists,\ \forall
\exists,\ \forall
“there exists”, “for all”Quantifiers. The site mostly writes “for all” in words; ∃\exists appears in the definition of the q-ary lattice Λq(A)\Lambda_q(A).∃ s∈Zn:y≡A⊤s\exists\, s \in \mathbb{Z}^n : y \equiv A^\top s1.6
±\pm
\pm
“plus or minus”Either sign. {0,±1}\{0, \pm 1\} is the set {−1,0,1}\{-1, 0, 1\}, the usual alphabet of ternary secrets, and det⁡(U)=±1\det(U) = \pm 1 defines unimodular matrices.det⁡(U)=±1\det(U) = \pm 12.6, 2.4, 3.3, 2.5, 1.6, 7.4

Greek letters

Only letters that appear on the site are listed. Several carry more than one meaning, usually because a standard or a paper fixed the name first (ML-DSA’s β,γ1,η\beta, \gamma_1, \eta clash with the BKZ block size, the Hermite constant and the smoothing parameter). The surrounding text always says which one is meant; the column below lists every use we found.

LetterName and pronunciationMeanings on this site
α\alphaalpha (AL-fuh)The real number being approximated or tested for relations (7.2, 7.3).
β\betabeta (BAY-tuh)BKZ block size (8.3). In ML-DSA, the bound β=τη\beta = \tau\eta on ∥cs1∥∞\|cs_1\|_\infty (3.3).
γ\gammagamma (GAM-uh)Approximation factor in SVPγ\mathrm{SVP}_\gamma, CVPγ\mathrm{CVP}_\gamma; Hermite constant γn\gamma_n (8.3); ML-DSA parameters γ1,γ2\gamma_1, \gamma_2; an NTT constant in 3.5.
δ\deltadelta (DEL-tuh)LLL parameter (δ=3/4\delta = 3/4 or 0.99); root-Hermite factor δ0\delta_0 (8.3).
ε, ϵ\varepsilon,\ \epsilonepsilon (EP-si-lon)A small positive number: the tolerance in the smoothing parameter ηε\eta_\varepsilon (8.5), an advantage in 3.4, signs ϵi∈{±1}\epsilon_i \in \{\pm 1\} in 4.3.
ζ\zetazeta (ZAY-tuh)A root of unity: ζ=17\zeta = 17 in ML-KEM’s NTT, ζ2n\zeta_{2n} for cyclotomic fields (8.4).
η\etaeta (AY-tuh)Smoothing parameter ηε(Λ)\eta_\varepsilon(\Lambda) (8.5); the coefficient bound of secrets in ML-KEM and ML-DSA; the LLL size-reduction constant 0.501 in g6k-rs.
θ\thetatheta (THAY-tuh)An angle between vectors (1.2, 4.5).
κ\kappakappa (KAP-uh)The start index of a BKZ block in g6k’s pump (4.4).
λ\lambdalambda (LAM-duh)Successive minima λ1,…,λn\lambda_1, \dots, \lambda_n; λ1\lambda_1 is the length of a shortest nonzero vector (8.3).
μ\mumu (MYOO)Gram–Schmidt coefficients μij\mu_{ij} (8.2); covering radius μ(Λ)\mu(\Lambda) in 1.4; a message bit or message representative in 2.3 and 3.3.
π\pipi (PIE)The constant 3.14159…, usually inside Gaussian formulas such as n/(2πe)\sqrt{n/(2\pi e)}.
ρ\rhorho (ROH)Gaussian function ρs\rho_s (8.5); packing radius ρ=λ1/2\rho = \lambda_1/2 in 1.4; the public 32-byte seed in ML-KEM and ML-DSA.
σ\sigmasigma (SIG-muh)Standard deviation of a Gaussian or of the noise (8.5); a seed in 3.1; the canonical embedding σ:R→Cn\sigma: R \to \mathbb{C}^n in 3.2.
τ\tautau (TOW)Number of ±1 entries in the ML-DSA challenge (3.3).
χ\chichi (KY)The error distribution in LWE (8.5).
ψ\psipsi (SIGH)A primitive 2n2n-th root of unity in the negacyclic NTT (3.5).
ω\omegaomega (oh-MAY-guh)A root of unity in 3.5; the maximum number of hint bits in ML-DSA (3.3).
Γ\Gammacapital gammaThe gamma function in the volume of the unit ball, Vn=πn/2/Γ(n/2+1)V_n = \pi^{n/2}/\Gamma(n/2+1) (1.3, 1.4).
Δ\Deltacapital deltaPacking density Δ(Λ)\Delta(\Lambda) (1.4, 1.6); the CKKS scaling factor Δ=240\Delta = 2^{40} (3.2).
Λ\Lambdacapital lambdaA lattice (8.3). The embedding guides call the same object LL.
Φ\Phicapital phi (FYE)The potential function that proves LLL terminates (1.5).

Conventions we follow

Further reading

For modular arithmetic and rounding conventions as used in the standards, see the notation sections of FIPS 203 (§2.3) and FIPS 204 (§2.3). For asymptotic notation, Cormen, Leiserson, Rivest and Stein, Introduction to Algorithms, chapter 3, is the standard reference (cited from memory).