File perl-Crypt-Primes.spec of Package perl-Crypt-Primes

Overview Repositories Revisions Requests Users Attributes Meta

File perl-Crypt-Primes.spec of Package perl-Crypt-Primes

#
# spec file for package perl-Crypt-Primes
#
# Copyright (c) 2024 SUSE LLC
#
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
# upon. The license for this file, and modifications and additions to the
# file, is the same license as for the pristine package itself (unless the
# license for the pristine package is not an Open Source License, in which
# case the license is the MIT License). An "Open Source License" is a
# license that conforms to the Open Source Definition (Version 1.9)
# published by the Open Source Initiative.

# Please submit bugfixes or comments via https://bugs.opensuse.org/
#

Name:           perl-Crypt-Primes
Version:        0.50
Release:        0
%define cpan_name Crypt-Primes
Summary:        Provable Prime Number Generator suitable for Cryptographic Applications
License:        Artistic-1.0 OR GPL-1.0-or-later
Group:          Development/Libraries/Perl
URL:            https://metacpan.org/release/%{cpan_name}
Source0:        https://cpan.metacpan.org/authors/id/V/VI/VIPUL/%{cpan_name}-%{version}.tar.gz
Source1:        cpanspec.yml
Patch0:         math-pariinit.patch
BuildArch:      noarch
BuildRoot:      %{_tmppath}/%{name}-%{version}-build
BuildRequires:  perl
BuildRequires:  perl-macros
BuildRequires:  perl(Crypt::Random) >= 0.33
BuildRequires:  perl(Math::Pari) >= 2.001804
Requires:       perl(Crypt::Random) >= 0.33
Requires:       perl(Math::Pari) >= 2.001804
%{perl_requires}

%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.

%prep
%autosetup  -n %{cpan_name}-%{version} -p0

find . -type f ! -path "*/t/*" ! -name "*.pl" ! -path "*/bin/*" ! -path "*/script/*" ! -name "configure" -print0 | xargs -0 chmod 644

%build
perl Makefile.PL INSTALLDIRS=vendor
make %{?_smp_mflags}

%check
make test

%install
%perl_make_install
%perl_process_packlist
%perl_gen_filelist

%files -f %{name}.files
%defattr(-,root,root,755)
%doc Changes docs README

%changelog

Places

File perl-Crypt-Primes.spec of Package perl-Crypt-Primes

Places