Cryptography Reference
In-Depth Information
B.9 Number-Theoretic Member Functions
LINT
chinrem (const LINT& m,
const LINT& b,
const LINT& n) const;
return a solution
x
of the system
of
simultaneous
congruences
≡
a
mod
m
and
x
≡
b
mod
n
,if
a solution exists
x
LINT
gcd (const LINT& b);
return gcd of
a
and
b
LINT
introot (void) const;
return integer part of the
b
th root
of
a
LINT
introot (const USHORT b)
const;
return integer part of the
b
th root
of
a
LINT
inv (const LINT& b) const;
return the multiplicative inverse
of
a
mod
b
int
iseven (void) const;
test
a
for divisibility by 2: true if
a
even
int
isodd (void) const;
test
a
for divisibility by 2: true if
a
odd
int
isprime (int nsp = 302,
int rnds = 0) const;
test
a
for primality
LINT
issqr (void) const;
test
a
for being square
return the Jacobi symbol
b
int
jacobi (const LINT& b) const;
LINT
lcm (const LINT& b) const;
return the least common multi-
ple of
a
and
b
log
2
(
a
)
unsigned int
ld (void) const;
return
