Cryptography Reference
In-Depth Information
O
()
“Big-Oh.” For two real-valued functions
f
and
g
with
g
(
x
)
≥
0
one writes
f
=
O
(
g
)
and says “
f
is big-Oh of
g
” if there exists
a constant
C
such that
f
(
x
)
≤ Cg
(
x
)
for all
x
sufficiently large.
a
b
Jacobi symbol (Section 10.4.1)
x
greatest integer less than or equal to
x
x
least integer greater than or equal to
x
P
the set of computational problems that can be
solved in polynomial time
NP
the set of computational problems that can be
solved nondeterministically in polynomial time
log
b
x
logarithm of
x
to the base
b
B
=2
16
, the base for the representation of objects
of type
CLINT
B
MAX
b
maximal number of digits for a
CLINT
object to base
B
MAX
2
maximal number of digits for a
CLINT
object to base
2
N
max
largest natural number that can be represented
by a
CLINT
object
