Cryptography Reference
In-Depth Information
LINT
strongprime (const LINT& pmin,
const LINT& pmax,
USHORT lt,
USHORT lr,
USHORT ls,
const LINT& f);
prime
p
with
return
a
strong
pmin
≤ p ≤
pmax
,
gcd(
p −
1
,
f
)=1
,
f
odd, lengths
lr
,
lt
,
ls
of prime divisors
r
of
p −
1
,
t
of
r
−
1
,
s
of
p
+1
LINT
strongprime (USHORT l);
return a strong prime
p
of length
l
bits, i.e.,
2
l
−
1
p<
2
l
≤
LINT
strongprime (USHORT l,
const LINT& f);
return a strong prime
p
of length
l
bits, i.e.,
2
l
−
1
≤ p<
2
l
, with
gcd(
p −
1
,
f
)=1
,
f
odd
LINT
strongprime (USHORT l,
USHORT lt,
USHORT lr,
USHORT ls,
LINT& f);
return a strong prime
p
of length
l
bits, i.e.,
2
l
−
1
≤ p<
2
l
, with
gcd(
p
−
1
,
f
)=1
,
f
odd
lt
1
4
,
ls
≈
lr
1
2
of length of
p
int
twofact (const LINT& even,
LINT& odd);
return the even part of
a
,
odd
contains the odd part of
a
LINT
xgcd (const LINT& a,
const LINT& b,
LINT& u, int& sign_u,
LINT& v, int& sign_v);
extended Euclidean algorithm
with return of gcd of
a
and
b
,
u
and
v
contain the absolute
values of the factors of the linear
combination
g = sign_u*u*a +
sign_v*v*b