Cryptography in C and C++, Second Edition

Appendix E. Notation

•	the set of nonnegative integers 0, 1, 2, 3, . . .
•+	the set of positive integers 1, 2, 3, . . .
•	the set of integers . . . , −2, −1, 0, 1, 2, 3, . . .
•n	the residue class ring modulo n over the integers (Chapter 5)
•×n	reduced residue system modulo n
•pn	finite field with pn elements
ā	the residue class a + n• in •n
a ≍ b	a approximately equal to b
a	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 n	a is congruent to b modulo n, that is, n | (a − b)
a	a is not congruent to b modulo n, that is, n ∤ (a − b