src/vendor/leemon.js
function randTruePrime(k) {
  var ans=int2bigInt(0, k, 0);
  randTruePrime_(ans, k);
  return trim(ans, 1);
}
function randTruePrime(k) {
  var ans=int2bigInt(0, k, 0);
  randTruePrime_(ans, k);
  return trim(ans, 1);
}
function randTruePrime ( k ) { var ans = int2bigInt ( 0 , k , 0 ) ; randTruePrime_ ( ans , k ) ; return trim ( ans , 1 ) ; }
return a k-bit true random prime using Maurer's algorithm.
return a k - bit true random prime using Maurer s algorithm .