Notation

[Page xi]

Even the natives have difficulty mastering this peculiar vocabulary.

The Golden Bough, Sir James George Frazer

Symbol	Expression	Meaning
D, K	D(K, Y)	Symmetric decryption of ciphertext Y using secret key K.
D, PRa	D(PRa, Y)	Asymmetric decryption of ciphertext Y using A's private key PRa
D,PUa	D(PUa, Y)	Asymmetric decryption of ciphertext Y using A's public key PUa
E, K	E(K, X)	Symmetric encryption of plaintext X using secret key K.
E, PRa	E(PRa, X)	Asymmetric encryption of plaintext X using A's private key PRa
E, PUa	E(PUa, X)	Asymmetric encryption of plaintext X using A's public key PUa
K		Secret key
PRa		Private key of user A
PUa		Public key of user A
C, K	C(K, X)	Message authentication code of message X using secret key K.
GF(p)		The finite field of order p, where p is prime. The field is defined as the set Zp together with the arithmetic operations modulo p.
GF(2n)		The finite field of order 2n.
Zn		Set of nonnegative integers less than n
gcd	gcd(i, j)	Greatest common divisor; the largest positive integer that divides both i and j with no remainder on division.
mod	a mod m	Remainder after division of a by m.
mod,	a m)	a mod m = b mod m
mod,	a m)	a mod m m
dlog	dloga,p(b)	Discrete logarithm of the number b for the base a (mod p)
f	f(n)	The number of positive integers less than n and relatively prime to n. This is Euler's totient function.
S		a1 + a2 + ... + an
		a1 x a2 x ... x an
|	i|j	i divides j, which means that there is no remainder when j is divided by i
|,|	|a|	Absolute value of a
||	x||y	x concatenated with y
	x x is approximately equal to y
	x Exclusive-OR of x and y for single-bit variables; Bitwise exclusive-OR of x and y for multiple-bit variables
,		The largest integer less than or equal to x
	x S	The element x is contained in the set S.
	A (a1,a2, ...,ak)	The integer A corresponds to the sequence of integers (a1,a2, ...,ak)