Cryptography Reference
In-Depth Information
APPENDIX E
Notation
N
the set of nonnegative integers
0
,
1
,
2
,
3
,...
+
N
the set of positive integers
1
,
2
,
3
,...
Z
the set of integers
...,
−
2
,
−
1
,
0
,
1
,
2
,
3
,...
Z
the residue class ring modulo
n
over the integers (Chapter 5)
n
Z
n
reduced residue system modulo
n
finite field with
p
n
elements
F
p
n
a
the residue class
a
+
n
Z
Z
n
in
a ≈ b
a
approximately equal to
b
a
b
a
less than and approximately equal to
b
a ← b
assignment: the variable
a
is given the value
b
|a|
absolute value of
a
a
|
b
a
divides
b
without remainder
a
b
a
does not divide
b
a
≡
b
mod
na
is congruent to
b
modulo
n
,thatis,
n
|
(
a
−
b
)
a ≡ b
mod
na
is not congruent to
b
modulo
n
,thatis,
n
(
a − b
)
gcd(
a, b
)
greatest common divisor of
a
and
b
(Section 10.1)
lcm(
a, b
)
least common multiple of
a
and
b
(Section 10.1)
φ
(
n
)
Euler phi function (Section 10.2)
