Cryptography Reference
In-Depth Information
unsigned
iroot_l (CLINT a_l, CLINT r_l)
integer part of square root of
a_l
,
output in
r_l
int
jacobi_l (CLINT a_l, CLINT b_l)
a_l
Legendre/Jacobi
symbol,
over
b_l
void
lcm_l (CLINT a_l, CLINT b_l,
CLINT v_l)
of
a_l
least
common
multiple
and
b_l
, output in
v_l
int prime_l (CLINT n_l,
unsigned noofsmallprimes,
unsigned iterations)
Miller-Rabin primality test of
n_l
with division sieve
int
primroot_l (CLINT x_l,
unsigned noofprimes,
clint** primes_l)
determine a primitive root mod-
ulo
n
, output in
x_l
int
proot_l (CLINT a_l, CLINT p_l,
CLINT x_l)
of
a_l
mod
p_l
,
square
root
output in
x_l
int
root_l (CLINT a_l, CLINT p_l,
CLINT q_l, CLINT x_l)
square root of
a_l
mod
p_l*q_l
,
output in
x_l
USHORT
sieve_l (CLINT a_l,
unsigned noofsmallprimes)
division sieve, division of
a_l
by
small primes
void
xgcd_l (CLINT a_l, CLINT b_l,
CLINT g_l,
CLINT u_l, int *sign_u,
CLINT v_l, int *sign_v)
greatest common divisor of
a_l
and
b_l
and representation of gcd
in
u_l
and
v_l
with sign in
sign_u
and
sign_v
A.6 Generation of Pseudorandom Numbers
UCHAR
bRand_l (STATEPRNG *xrstate)
generation of a pseudorandom
number of type
UCHAR
