./security/p5-Crypt-Primes, Perl5 module for provable prime number generation

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2009Q3, Version: 0.50nb3, Package name: p5-Crypt-Primes-0.50nb3, Maintainer: heinz

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.


Required to run:
[math/p5-Math-Pari] [security/p5-Crypt-Random] [lang/perl5]

Master sites: (Expand)

SHA1: 1b61c6693b7d703514082ddb5821cdfd45274e81
RMD160: c8d2aa1ce56c0e6f4f7228bcb0917edd0a964a10
Filesize: 133.104 KB

Version history: (Expand)