Provable Prime Number Generator suitable for Cryptographic Applications
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/u?random devices found on
most modern Unix operating systems.
- Sources inherited from project devel:languages:perl
-
1
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:Tomcat42/perl-Crypt-Primes && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
Crypt-Primes-0.50.tar.gz | 0000136299 133 KB | |
cpanspec.yml | 0000000663 663 Bytes | |
math-pariinit.patch | 0000000440 440 Bytes | |
perl-Crypt-Primes.changes | 0000001207 1.18 KB | |
perl-Crypt-Primes.spec | 0000002716 2.65 KB |
Latest Revision
Dirk Stoecker (dstoecker)
accepted
request 1156160
from
Tina Müller (tinita)
(revision 11)
- Use %autosetup instead of deprecated %patchN
Comments 0