Package perl-Crypt-Primes: Information

    Source package: perl-Crypt-Primes
    Version: 0.50-alt2
    Build time:  Sep 18, 2008, 01:54 PM
    Category: Development/Perl
    Report package bug
    License: Artistic
    Summary: Crypt-Primes - Provable Prime Number Generator suitable for Cryptographic Applications
    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.  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 most modern Unix operating systems.

    List of rpms provided by this srpm:
    perl-Crypt-Primes (noarch)

    Maintainer: Vitaly Lipatov

    List of contributors:
    Vitaly Lipatov


      1. perl-Class-Loader
      2. perl-Crypt-Random
      3. perl-Math-Pari
      4. perl-devel

    Last changed


    Sept. 6, 2008 Vitaly Lipatov 0.50-alt2
    - fix directory ownership violation
    Aug. 27, 2005 Vitaly Lipatov 0.50-alt1
    - first build for ALT Linux Sisyphus