/usr/include/eclib/curvemod.h is in libec-dev 20160720-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // curvemod.h: declaration of class curvemodq for elliptic curve mod (prime) q
//////////////////////////////////////////////////////////////////////////
//
// 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
//
//////////////////////////////////////////////////////////////////////////
// allow for multiple includes
#ifndef _CURVEMOD_
#define _CURVEMOD_
// Class for an elliptic curve mod q
//
// The q is fixed -- must be set before use!
//
class pointmodq;
class curvemodq {
protected:
galois_field* Fq; // pointer to ground field
bigint q; // the modulus
gf_element a1,a2,a3,a4,a6; // the coefficients mod q
bigint order; // number of points (0 if not set)
public:
// constructors
curvemodq(void);
curvemodq(const Curve& E, const bigint& qq);
~curvemodq();
curvemodq(const curvemodq& C); // copy constructor
void operator=(const curvemodq& C); // assignment
// access
void get_ai(gf_element& aa1, gf_element& aa2, gf_element& aa3, gf_element& aa4, gf_element& aa6) const
{
aa1=a1; aa2=a2; aa3=a3; aa4=a4; aa6=a6;
}
// output
void output(ostream& os) const {os<<"["<<a1<<","<<a2<<","<<a3<<","<<a4<<","<<a6<<"] mod "<<q;}
// equality test
int operator==(const curvemodq& C) const
{ return (q==C.q)&&(a1==C.a1)&&(a2==C.a2)&&(a3==C.a3)&&(a4==C.a4)&&(a6==C.a6);}
int operator!=(const curvemodq& C) const
{ return (q!=C.q)||(a1!=C.a1)||(a2!=C.a2)||(a3!=C.a3)||(a4!=C.a4)||(a6!=C.a6);}
// random point
pointmodq random_point(); // defined in pointsmod.cc
bigint get_modulus() const { return q; }
void set_group_order_via_legendre();
void set_group_order();
bigint group_order() {if(is_zero(order)) set_group_order(); return order;}
friend class galois_field;
friend class ffmodq;
friend class pointmodq;
friend class TLSS;
friend galois_field get_field(const curvemodq& C);
friend bigint get_modulus(const curvemodq& E);
};
inline ostream& operator<<(ostream& os, const curvemodq& C)
{
C.output(os);
return os;
}
// just a wrapper round the constructor, (originally for for LiDIA-compatibility):
inline curvemodq reduce_curve(const Curve& E, const bigint& q)
{
return curvemodq(E,q);
}
inline galois_field get_field(const curvemodq& C) { return galois_field(C.q); }
inline bigint get_modulus(const curvemodq& C) { return C.q; }
FqPoly div_pol_odd(const curvemodq& C, int n);
FqPoly makepdivpol(const curvemodq& C, int p);
#endif // #define _CURVEMOD_
|