v 0.500.0

Provable Prime Number Generator suitable for Cryptographic Applications.

This module implements Ueli Maurer's algorithm for generating large provable primes and secure parameters for public-key cryptosystems. The generated primes are almost uniformly distributed over the set of primes of the specified bitsize and expected time for generation is less than the time required for generating a pseudo-prime of the same size with Miller-Rabin tests.


Add to my watchlist

Installations 1
Requested Installations 1