Provable Prime Number Generator suitable for Cryptographic Applications

1 files changed, 12 insertions, 0 deletions

diff --git a/security/p5-Crypt-Primes/pkg-descr b/security/p5-Crypt-Primes/pkg-descr
new file mode 100644
index 000000000000..eda828ea65b9
--- /dev/null
+++ b/security/p5-Crypt-Primes/pkg-descr
@@ -0,0 +1,12 @@
+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. Detailed description and running time
+analysis of the algorithm can be found in Maurer's paper[1].
+
+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/u?random devices found on modern Unix operating systems.