6cf0a1a7e7
- Crypt-DH-0.03, Diffie-Hellman implementation - Crypt-DSA-0.12, DSA implementation - Crypt-Primes-0.50, prime number generator - Crypt-RSA-1.55, RSA implementation - Crypt-Random-1.23, cryptographically secure random number generator all written in pure perl
12 lines
648 B
Plaintext
12 lines
648 B
Plaintext
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.
|
|
|
|
Crypt::Primes is a pure perl implementation. It uses Math::Pari for
|
|
multiple precision integer arithmetic and number theoretic functions.
|
|
Random numbers are gathered with Crypt::Random, a perl interface to
|
|
/dev/arandom device found on most modern Unix operating systems.
|