Generating PHI the secret Modulus
Phi == %s
",$big_num);
$phi = $big_num;
printf(" which is the result of (%s-1)*(%s-1)
\n", $p,$q);
//
// of the number. To convert log x = ln(x) / ln(a)
// a
//
//$k = `./ln2 $phi`;
//printf(" The large number here, as a rough guide ",strlen($big_num)-1);
//printf(" is capable of encrypting a %s bit length key
",$k-1);
?>
Note this is part of the secret key !