Cryptography Reference
In-Depth Information
if (p.iseven())
{
++p;
}
}
}
return p;
}
Additionally, the function
findprime()
is overloaded so that instead of the
interval boundaries
p
min
and
p
max
a binary length can be set.
generation of a prime number
p
within the interval
Function:
2
−
1
,
2
−
1
satisfying the additional condition
gcd(
p −
1
,f
)=1
,
f
an odd positive integer
LINT
findprime(USHORT l, const LINT& f);
Syntax:
l
: desired binary length
f
: odd positive integer, which should be relatively
prime to
p
Input:
−
1
LINT
prime
p
with
gcd(
p −
1
,f
)
Return:
With regard to the key length to be chosen, a look at the development
worldwide of attempts at factorization is most informative: In April 1996 after
months-long cooperative work at universities and research laboratories in the
USA and Europe under the direction of A.K. Lenstra
3
the RSA modulus
RSA-130
= 18070820886874048059516561644059055662781025167694013
4917012702145005666254024404838734112759081
2303371781887966563182013214880557
with 130 decimal places was factored as
3
Sieve
,
http://
Lenstra:
Arjen
K.:
Factorization
of
RSA-130
using
the
Number
Field
dbs.cwi.nl.herman.NFSrecords/RSA-130
;
see also [Cowi].
