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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
// telog.cc -- to test elog.h/cc
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the eclib package.
//
// eclib is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2 of the License, or (at your
// option) any later version.
//
// eclib is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
// for more details.
//
// You should have received a copy of the GNU General Public License
// along with eclib; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
//
#include <eclib/curve.h>
#include <eclib/points.h>
#include <eclib/cperiods.h>
#include <eclib/elog.h>
int test1(Curvedata& CD, Cperiods& per, const Point& P)
{
bigcomplex z=elliptic_logarithm(CD,per,P);
cout<<"Elliptic log of P is "<<z<<endl;
Point Q=ellztopoint(CD,per,z,P.getZ());
cout<<"Reconstructed P = "<<Q<<endl;
return (P==Q);
}
void test2(Curvedata& CD, Cperiods& per, const Point& P, int m)
{
vector<Point> Qlist = division_points(CD, per, m*P, m);
cout<<"(m*"<<P<<")/m = "<<Qlist<<endl;
if(Qlist.size()==0) return;
cout<<"Checking..."<<endl;
unsigned int i; for(i=0; i<Qlist.size(); i++)
{
Point Q = Qlist[i];
if(m*Q==m*P) cout<<Q<<" OK"<<endl;
else cout<<Q<<" wrong"<<endl;
}
}
// torsion test:
void test3(Curvedata& CD, Cperiods& per, int m)
{
cout<<"torsion point test (m="<<m<<")"<<endl;
vector<Point> Qlist = torsion_points(CD, per, m);
cout<<"m-torsion points: "<<Qlist<<endl;
if(Qlist.size()==0) return;
cout<<"Checking..."<<endl;
unsigned int i; for(i=0; i<Qlist.size(); i++)
{
Point Q = Qlist[i];
if((m*Q).is_zero()) cout<<Q<<" OK"<<endl;
else cout<<Q<<" wrong"<<endl;
}
}
int main(){
#ifdef MPFP
// set_precision("Enter precision in bits");
set_precision(175);
long original_output_precision = RR::OutputPrecision();
RR::SetOutputPrecision(original_output_precision-3);
#endif
initprimes("PRIMES",0);
// a curve with rank 3 and D>0:
Curve c(BIGINT(0),BIGINT(0),BIGINT(1),BIGINT(-7),BIGINT(6));
Curvedata cd(c,1);
cout << "Testing some points:\n";
Point P0(cd, BIGINT(0),BIGINT(2)) ;
Point P1(cd, BIGINT(1),BIGINT(0)) ;
Point P2(cd, BIGINT(2),BIGINT(0)) ;
cout << "The points are P0 = " << P0 <<
", P1 = " << P1 << ", and P2 = " << P2 << endl ;
if (!P0.isvalid()) cout << "P0 is not on the curve!\n";
if (!P1.isvalid()) cout << "P1 is not on the curve!\n";
if (!P2.isvalid()) cout << "P2 is not on the curve!\n";
/*
// a curve with rank 3 and D<0:
Curve c(BIGINT(0),BIGINT(0),BIGINT(1),BIGINT(-1),BIGINT(6));
Curvedata cd(c,1);
cout << "Testing some points:\n";
Point P0(cd, BIGINT(0),BIGINT(2)) ;
Point P1(cd, BIGINT(1),BIGINT(2)) ;
Point P2(cd, BIGINT(12),BIGINT(41)) ;
cout << "The points are P0 = " << P0 <<
", P1 = " << P1 << ", and P2 = " << P2 << endl ;
if (!P0.isvalid()) cout << "P0 is not on the curve!\n";
if (!P1.isvalid()) cout << "P1 is not on the curve!\n";
if (!P2.isvalid()) cout << "P2 is not on the curve!\n";
*/
/*
// a curve (7998K1) with rank 1 and 5-torsion:
Curve c(BIGINT(1),BIGINT(0),BIGINT(0),BIGINT(5355560),BIGINT(7740216896));
Curvedata cd(c,1);
Point P0(cd, BIGINT(-248),BIGINT(80104)) ;
cout << "The point is P0 = " << P0 << endl ;
if (!P0.isvalid()) cout << "P0 is not on the curve!\n";
*/
cout<<"Curve "<<c<<endl;
Cperiods cp(cd);
//cout<<"Periods: "<<cp<<endl;
cout<<endl;
if(test1(cd,cp,P0)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,P1)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,P2)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,2*P0)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,2*P1)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,2*P2)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,P0+P1)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,P1-P2)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
if(test1(cd,cp,P2-P0)) cout<<"OK!\n"<<endl;
else cout<<"WRONG!\n"<<endl;
test2(cd,cp,P0,2);cout<<endl;
test2(cd,cp,P0,3);cout<<endl;
test2(cd,cp,P0,5);cout<<endl;
cout << "================================ "<<endl;
Curve c3(BIGINT(1),BIGINT(1),BIGINT(0),BIGINT(-202),BIGINT(1025));
Curvedata cd3(c3,1);
cout << "Curve "<<c3<<endl;
Cperiods cp3(cd3);
//cout << "Periods: "<<cp3<<endl;
cout<<endl;
Point Q(cd3,BIGINT(-8),BIGINT(51));
cout << "The point Q is = " << Q << endl ;
test1(cd3,cp3,Q);
Point P3(cd3, BIGINT(8),BIGINT(-3)) ;
cout << "The point P3 is = " << P3 << endl ;
test1(cd3,cp3,P3);
test2(cd3,cp3,P3,3);cout<<endl;
cout << "================================ "<<endl;
/*
test3(cd,cp,2);cout<<endl;
test3(cd,cp,3);cout<<endl;
test3(cd,cp,5);cout<<endl;
*/
#ifdef MPFP
RR::SetOutputPrecision(original_output_precision);
#endif
return 0;
} //ends main
//ends file telog.cc
|
