1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
%global _empty_manifest_terminate_build 0
Name: python-cryptography318
Version: 0.4.0
Release: 1
Summary: A set of functions useful in cryptography and linear algebra
License: Public Domain
URL: https://github.com/aarpyy/Cryptography
Source0: https://mirrors.aliyun.com/pypi/web/packages/f7/b9/6328eb3964b8f8a42dbcdc4a1d653d0a9d3d4fca5d92bb6782753bc46db9/cryptography318-0.4.0.tar.gz
BuildArch: noarch
Requires: python3-numpy
Requires: python3-sympy
%description
# Cryptography318
Cryptography318 is a package intended to provide utility for important cryptographic and
linear algebra functions in Python. This package includes functions for generating primes,
primality tests including AKS, Miller-Rabin, Baillie-PSW, functions for factoring integers including
Pollard's P-1, Self-Initializing Quadratic Sieve, Pollard's Rho, and Lenstra's ECM factorization algorithm
using both Montgomery curves over projective space and short Weierstrass curves, functions for solving
discrete logarithm problems including Pollard's Rho method for logarithms,
baby-step-giant-step, and Pohlig-Hellman, support for working with elliptic curve cryptography including
'fast power algorithm' and baby-step-giant-step, general algebra functions such as Chinese Remainder and the
Euclidean Extended Algorithm for gcd's. In development is the index calculus method
for solving DLP's.
## Required Packages
* numpy
* sympy
## Install
```angular2html
$ pip install cryptography318
```
### License
[](https://opensource.org/licenses/MIT)
%package -n python3-cryptography318
Summary: A set of functions useful in cryptography and linear algebra
Provides: python-cryptography318
BuildRequires: python3-devel
BuildRequires: python3-setuptools
BuildRequires: python3-pip
%description -n python3-cryptography318
# Cryptography318
Cryptography318 is a package intended to provide utility for important cryptographic and
linear algebra functions in Python. This package includes functions for generating primes,
primality tests including AKS, Miller-Rabin, Baillie-PSW, functions for factoring integers including
Pollard's P-1, Self-Initializing Quadratic Sieve, Pollard's Rho, and Lenstra's ECM factorization algorithm
using both Montgomery curves over projective space and short Weierstrass curves, functions for solving
discrete logarithm problems including Pollard's Rho method for logarithms,
baby-step-giant-step, and Pohlig-Hellman, support for working with elliptic curve cryptography including
'fast power algorithm' and baby-step-giant-step, general algebra functions such as Chinese Remainder and the
Euclidean Extended Algorithm for gcd's. In development is the index calculus method
for solving DLP's.
## Required Packages
* numpy
* sympy
## Install
```angular2html
$ pip install cryptography318
```
### License
[](https://opensource.org/licenses/MIT)
%package help
Summary: Development documents and examples for cryptography318
Provides: python3-cryptography318-doc
%description help
# Cryptography318
Cryptography318 is a package intended to provide utility for important cryptographic and
linear algebra functions in Python. This package includes functions for generating primes,
primality tests including AKS, Miller-Rabin, Baillie-PSW, functions for factoring integers including
Pollard's P-1, Self-Initializing Quadratic Sieve, Pollard's Rho, and Lenstra's ECM factorization algorithm
using both Montgomery curves over projective space and short Weierstrass curves, functions for solving
discrete logarithm problems including Pollard's Rho method for logarithms,
baby-step-giant-step, and Pohlig-Hellman, support for working with elliptic curve cryptography including
'fast power algorithm' and baby-step-giant-step, general algebra functions such as Chinese Remainder and the
Euclidean Extended Algorithm for gcd's. In development is the index calculus method
for solving DLP's.
## Required Packages
* numpy
* sympy
## Install
```angular2html
$ pip install cryptography318
```
### License
[](https://opensource.org/licenses/MIT)
%prep
%autosetup -n cryptography318-0.4.0
%build
%py3_build
%install
%py3_install
install -d -m755 %{buildroot}/%{_pkgdocdir}
if [ -d doc ]; then cp -arf doc %{buildroot}/%{_pkgdocdir}; fi
if [ -d docs ]; then cp -arf docs %{buildroot}/%{_pkgdocdir}; fi
if [ -d example ]; then cp -arf example %{buildroot}/%{_pkgdocdir}; fi
if [ -d examples ]; then cp -arf examples %{buildroot}/%{_pkgdocdir}; fi
pushd %{buildroot}
if [ -d usr/lib ]; then
find usr/lib -type f -printf "\"/%h/%f\"\n" >> filelist.lst
fi
if [ -d usr/lib64 ]; then
find usr/lib64 -type f -printf "\"/%h/%f\"\n" >> filelist.lst
fi
if [ -d usr/bin ]; then
find usr/bin -type f -printf "\"/%h/%f\"\n" >> filelist.lst
fi
if [ -d usr/sbin ]; then
find usr/sbin -type f -printf "\"/%h/%f\"\n" >> filelist.lst
fi
touch doclist.lst
if [ -d usr/share/man ]; then
find usr/share/man -type f -printf "\"/%h/%f.gz\"\n" >> doclist.lst
fi
popd
mv %{buildroot}/filelist.lst .
mv %{buildroot}/doclist.lst .
%files -n python3-cryptography318 -f filelist.lst
%dir %{python3_sitelib}/*
%files help -f doclist.lst
%{_docdir}/*
%changelog
* Tue Jun 20 2023 Python_Bot <Python_Bot@openeuler.org> - 0.4.0-1
- Package Spec generated
|
