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
|
Source: gmp-ecm
Section: math
Priority: optional
Maintainer: Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Jerome Benoit <calculus@rezozer.net>
Build-Depends:
debhelper (>= 9),
autotools-dev, gnulib, m4, dh-autoreconf, libtool,
gcc-6 [s390x],
libgmp-dev (>= 2:6.0)
#Build-Depends-Indep:
Standards-Version: 3.9.8
Homepage: http://ecm.gforge.inria.fr/
Vcs-Git: https://anonscm.debian.org/git/debian-science/packages/gmp-ecm.git
Vcs-Browser: https://anonscm.debian.org/cgit/debian-science/packages/gmp-ecm.git
Package: gmp-ecm
Architecture: any
Pre-Depends: ${misc:Pre-Depends}
Depends: ${shlibs:Depends}, ${misc:Depends}
Breaks: ecm (<< 1.00-2)
Replaces: ecm (<< 1.00-2)
Multi-Arch: foreign
Description: Factor integers using the Elliptic Curve Method
gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.
.
The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.
.
See http://www.loria.fr/~zimmerma/records/ecmnet.html for more
information about ecmnet.
.
This package provides the command line utility.
Package: libecm1
Section: libs
Architecture: any
Pre-Depends: ${misc:Pre-Depends}
Depends: ${shlibs:Depends}, ${misc:Depends}
Multi-Arch: same
Description: factor integers using the Elliptic Curve Method -- lib
gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.
.
The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.
.
See http://www.loria.fr/~zimmerma/records/ecmnet.html for more
information about ecmnet.
.
This package provides the shared library.
Package: libecm1-dev
Section: libdevel
Architecture: any
Replaces: libecm0-dev
Breaks: libecm0-dev
Depends:
libecm1 (= ${binary:Version}), libecm1-dev-common (= ${source:Version}),
libgmp-dev, ${misc:Depends}
Multi-Arch: same
Description: factor integers using the Elliptic Curve Method -- libdev
gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.
.
The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.
.
See http://www.loria.fr/~zimmerma/records/ecmnet.html for more
information about ecmnet.
.
This package provides the static library and symbolic links needed
for development.
Package: libecm1-dev-common
Section: libdevel
Architecture: all
Replaces: libecm-dev (<= 6.4.4-2), libecm0-dev-common
Breaks: libecm-dev (<= 6.4.4-2), libecm0-dev-common
Depends: ${misc:Depends}
Recommends: libecm1-dev (=${binary:Version})
Multi-Arch: foreign
Description: factor integers using the Elliptic Curve Method -- header
gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.
.
The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.
.
See http://www.loria.fr/~zimmerma/records/ecmnet.html for more
information about ecmnet.
.
This package provides the header needed by developers.
Package: libecm-dev
Section: oldlibs
Priority: extra
Architecture: all
Pre-Depends: ${misc:Pre-Depends}
Depends: libecm1-dev (>= ${source:Version}), libecm1-dev (<< ${source:Version}.1~), ${misc:Depends}
Multi-Arch: foreign
Description: dummy package
This is a dummy package.
|
