# The security/p5-Crypt-Primes port

## p5-Crypt-Primes-0.50p1 – provable prime number generator

## Description

    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.

WWW: http://search.cpan.org/dist/Crypt-Primes/

Categories:
  perl5 security

## Library dependencies

## Build dependencies

- STEM->=1.21:textproc/groff
- security/p5-Crypt-Random

## Run dependencies

- security/p5-Crypt-Random