[65efd3] | 1 | /* emacs edit mode for this file is -*- C++ -*- */ |
---|
[341696] | 2 | /* $Id$ */ |
---|
[65efd3] | 3 | |
---|
| 4 | //{{{ docu |
---|
| 5 | // |
---|
[4a829c6] | 6 | // gengftables.cc - generate addition tables used by Factory |
---|
[65efd3] | 7 | // to calculate in GF(q). |
---|
| 8 | // |
---|
| 9 | // Note: This may take quite a while ... |
---|
| 10 | // |
---|
| 11 | //}}} |
---|
| 12 | |
---|
[efce9a] | 13 | #include "config.h" |
---|
| 14 | |
---|
[1dc616] | 15 | #ifdef HAVE_IOSTREAM |
---|
| 16 | #include <iostream> |
---|
| 17 | #include <fstream> |
---|
| 18 | #include <strstream> |
---|
[efce9a] | 19 | using namespace std; |
---|
[1dc616] | 20 | #elif defined(HAVE_IOSTREAM_H) |
---|
[65efd3] | 21 | #include <iostream.h> |
---|
| 22 | #include <fstream.h> |
---|
| 23 | #include <strstream.h> |
---|
[1dc616] | 24 | #endif |
---|
[65efd3] | 25 | |
---|
[502f5f6] | 26 | #include "cf_assert.h" |
---|
| 27 | #include "gf_tabutil.h" |
---|
[efce9a] | 28 | #include "cf_algorithm.h" |
---|
| 29 | #include "cf_iter.h" |
---|
| 30 | |
---|
[65efd3] | 31 | //{{{ constants |
---|
| 32 | //{{{ docu |
---|
| 33 | // |
---|
| 34 | // - constants. |
---|
| 35 | // |
---|
| 36 | // maxtable: maximal size of a gf_table |
---|
| 37 | // primes, primes_len: |
---|
| 38 | // used to step through possible extensions |
---|
| 39 | // |
---|
| 40 | //}}} |
---|
| 41 | const int maxtable = 32767; |
---|
| 42 | |
---|
| 43 | const int primes_len = 42; |
---|
| 44 | static unsigned short primes [] = |
---|
| 45 | { |
---|
| 46 | 2, 3, 5, 7, 11, 13, 17, 19, |
---|
| 47 | 23, 29, 31, 37, 41, 43, 47, 53, |
---|
| 48 | 59, 61, 67, 71, 73, 79, 83, 89, |
---|
| 49 | 97, 101, 103, 107, 109, 113, 127, 131, |
---|
| 50 | 137, 139, 149, 151, 157, 163, 167, 173, |
---|
| 51 | 179, 181 |
---|
| 52 | }; |
---|
| 53 | //}}} |
---|
| 54 | |
---|
| 55 | //{{{ bool isIrreducible ( const CanonicalForm & f ) |
---|
| 56 | //{{{ docu |
---|
| 57 | // |
---|
| 58 | // isIrreducible() - return true iff f is irreducible. |
---|
| 59 | // |
---|
| 60 | //}}} |
---|
| 61 | bool |
---|
| 62 | isIrreducible ( const CanonicalForm & f ) |
---|
| 63 | { |
---|
| 64 | CFFList F = factorize( f ); |
---|
| 65 | return F.length() == 1 && F.getFirst().exp() == 1; |
---|
| 66 | } |
---|
| 67 | //}}} |
---|
| 68 | |
---|
[4a829c6] | 69 | //{{{ int exponent ( const CanonicalForm & f, int q ) |
---|
[65efd3] | 70 | //{{{ docu |
---|
| 71 | // |
---|
| 72 | // exponent() - return e > 0 such that x^e == 1 mod f. |
---|
| 73 | // |
---|
| 74 | // q: upper limit for e (?) |
---|
| 75 | // |
---|
| 76 | //}}} |
---|
| 77 | int |
---|
[4a829c6] | 78 | exponent ( const CanonicalForm & f, int q ) |
---|
[65efd3] | 79 | { |
---|
| 80 | Variable x = f.mvar(); |
---|
| 81 | int e = 1; |
---|
| 82 | CanonicalForm prod = x; |
---|
| 83 | while ( e <= q && ! prod.isOne() ) { |
---|
[806c18] | 84 | e++; |
---|
| 85 | prod = ( prod * x ) % f; |
---|
[65efd3] | 86 | } |
---|
| 87 | return e; |
---|
| 88 | } |
---|
| 89 | //}}} |
---|
| 90 | |
---|
| 91 | //{{{ bool findGenRec ( int d, int n, int q, const CanonicalForm & m, const Variable & x, CanonicalForm & result ) |
---|
| 92 | //{{{ docu |
---|
| 93 | // |
---|
| 94 | // findGenRec() - find a generator of GF(q). |
---|
| 95 | // |
---|
| 96 | // Returns true iff result is a valid generator. |
---|
| 97 | // |
---|
| 98 | // d: degree of extension |
---|
| 99 | // q: the q in GF(q) (q == p^d) |
---|
| 100 | // x: generator should be a poly in x |
---|
| 101 | // n, m: used to step recursively through all polys in FF(p) |
---|
| 102 | // Initially, n == d and m == 0. If 0 <= n <= d we are |
---|
| 103 | // in the process of building m, if n < 0 we built m and |
---|
| 104 | // may test whether it generates GF(q). |
---|
| 105 | // result: generator found |
---|
| 106 | // |
---|
| 107 | // i: used to step through GF(p) |
---|
| 108 | // p: current characteristic |
---|
| 109 | // |
---|
| 110 | //}}} |
---|
| 111 | bool |
---|
| 112 | findGenRec ( int d, int n, int q, |
---|
[806c18] | 113 | const CanonicalForm & m, const Variable & x, |
---|
| 114 | CanonicalForm & result ) |
---|
[65efd3] | 115 | { |
---|
| 116 | int i, p = getCharacteristic(); |
---|
| 117 | if ( n < 0 ) { |
---|
[806c18] | 118 | cerr << "."; cerr.flush(); |
---|
| 119 | // check whether m is irreducible |
---|
| 120 | if ( isIrreducible( m ) ) { |
---|
| 121 | cerr << "*"; cerr.flush(); |
---|
| 122 | // check whether m generates multiplicative group |
---|
| 123 | if ( exponent( m, q ) == q - 1 ) { |
---|
| 124 | result = m; |
---|
| 125 | return true; |
---|
| 126 | } |
---|
| 127 | else |
---|
| 128 | return false; |
---|
| 129 | } |
---|
| 130 | else |
---|
| 131 | return false; |
---|
[65efd3] | 132 | } |
---|
| 133 | // for each monomial x^0, ..., x^n, ..., x^d, try all possible coefficients |
---|
| 134 | else if ( n == d || n == 0 ) { |
---|
[806c18] | 135 | // we want to have a leading coefficient and a constant term, |
---|
| 136 | // so start with coefficient >= 1 |
---|
| 137 | for ( i = 1; i < p; i++ ) |
---|
| 138 | if ( findGenRec( d, n-1, q, m + i * power( x, n ), x, result ) ) |
---|
| 139 | return true; |
---|
[65efd3] | 140 | } |
---|
| 141 | else { |
---|
[806c18] | 142 | for ( i = 0; i < p; i++ ) |
---|
| 143 | if ( findGenRec( d, n-1, q, m + i * power( x, n ), x, result ) ) |
---|
| 144 | return true; |
---|
[65efd3] | 145 | } |
---|
| 146 | return false; |
---|
| 147 | } |
---|
| 148 | //}}} |
---|
| 149 | |
---|
[4a829c6] | 150 | //{{{ CanonicalForm findGen ( int d, int q ) |
---|
[65efd3] | 151 | //{{{ docu |
---|
| 152 | // |
---|
| 153 | // findGen() - find and return a generator of GF(q). |
---|
| 154 | // |
---|
| 155 | // d: degree of extension |
---|
| 156 | // q: the q in GF(q) |
---|
| 157 | // |
---|
| 158 | //}}} |
---|
| 159 | CanonicalForm |
---|
[4a829c6] | 160 | findGen ( int d, int q ) |
---|
[65efd3] | 161 | { |
---|
| 162 | Variable x( 1 ); |
---|
| 163 | CanonicalForm result; |
---|
| 164 | cerr << "testing p = " << getCharacteristic() << ", d = " << d << " ... "; |
---|
| 165 | cerr.flush(); |
---|
| 166 | bool ok = findGenRec( d, d, q, 0, x, result ); |
---|
| 167 | cerr << endl; |
---|
| 168 | if ( ! ok ) |
---|
[806c18] | 169 | return 0; |
---|
[65efd3] | 170 | else |
---|
[806c18] | 171 | return result; |
---|
[65efd3] | 172 | } |
---|
| 173 | //}}} |
---|
| 174 | |
---|
[4a829c6] | 175 | //{{{ void printTable ( int d, int q, CanonicalForm mipo ) |
---|
[65efd3] | 176 | //{{{ docu |
---|
| 177 | // |
---|
| 178 | // printTable - print +1 table of field GF(q). |
---|
| 179 | // |
---|
| 180 | // d: degree of extension |
---|
| 181 | // q: the q in GF(q) |
---|
| 182 | // mipo: the minimal polynomial of the extension |
---|
| 183 | // |
---|
| 184 | // p: current characteristic |
---|
| 185 | // |
---|
| 186 | //}}} |
---|
| 187 | void |
---|
[4a829c6] | 188 | printTable ( int d, int q, CanonicalForm mipo ) |
---|
[65efd3] | 189 | { |
---|
| 190 | int i, p = getCharacteristic(); |
---|
| 191 | |
---|
| 192 | // open file to write to |
---|
| 193 | ostrstream fname; |
---|
| 194 | fname << "gftables/gftable." << p << "." << d << '\0'; |
---|
| 195 | char * fn = fname.str(); |
---|
| 196 | ofstream outfile; |
---|
| 197 | outfile.open( fn, ios::out ); |
---|
| 198 | STICKYASSERT1( outfile, "can not open GF(q) table %s for writing", fn ); |
---|
| 199 | delete fn; |
---|
| 200 | |
---|
| 201 | cerr << "mipo = " << mipo << ": "; |
---|
| 202 | cerr << "generating multiplicative group ... "; |
---|
| 203 | cerr.flush(); |
---|
| 204 | |
---|
| 205 | CanonicalForm * T = new CanonicalForm[maxtable]; |
---|
| 206 | Variable x( 1 ); |
---|
| 207 | |
---|
| 208 | // fill T with powers of x |
---|
| 209 | T[0] = 1; |
---|
| 210 | for ( i = 1; i < q; i++ ) |
---|
[806c18] | 211 | T[i] = ( T[i-1] * x ) % mipo; |
---|
[65efd3] | 212 | |
---|
| 213 | cerr << "generating addition table ... "; |
---|
| 214 | cerr.flush(); |
---|
| 215 | |
---|
| 216 | // brute force method |
---|
| 217 | int * table = new int[maxtable]; |
---|
| 218 | CanonicalForm f; |
---|
| 219 | |
---|
| 220 | for ( i = 0; i < q; i++ ) { |
---|
[806c18] | 221 | f = T[i] + 1; |
---|
| 222 | int j = 0; |
---|
| 223 | while ( j < q && T[j] != f ) j++; |
---|
| 224 | table[i] = j; |
---|
[65efd3] | 225 | } |
---|
| 226 | |
---|
| 227 | cerr << "writing table ... "; |
---|
| 228 | cerr.flush(); |
---|
| 229 | |
---|
| 230 | outfile << "@@ factory GF(q) table @@" << endl; |
---|
| 231 | outfile << p << " " << d << " " << mipo << "; "; |
---|
| 232 | |
---|
| 233 | // print simple reprenstation of mipo |
---|
| 234 | outfile << d; |
---|
| 235 | CFIterator MiPo = mipo; |
---|
| 236 | for ( i = d; MiPo.hasTerms(); i--, MiPo++ ) { |
---|
[806c18] | 237 | int exp; |
---|
| 238 | for ( exp = MiPo.exp(); exp < i; i-- ) |
---|
| 239 | outfile << " 0"; |
---|
| 240 | outfile << " " << MiPo.coeff(); |
---|
[65efd3] | 241 | } |
---|
| 242 | // since mipo is irreducible, it has a constant term, |
---|
| 243 | // so i == 0 at this point |
---|
| 244 | outfile << endl; |
---|
| 245 | |
---|
| 246 | int m = gf_tab_numdigits62( q ); |
---|
| 247 | char * outstr = new char[30*m+1]; |
---|
| 248 | outstr[30*m] = '\0'; |
---|
| 249 | i = 1; |
---|
| 250 | while ( i < q ) { |
---|
[806c18] | 251 | int k = 0; |
---|
| 252 | char * sptr = outstr; |
---|
| 253 | while ( i < q && k < 30 ) { |
---|
| 254 | convert62( table[i], m, sptr ); |
---|
| 255 | sptr += m; |
---|
| 256 | k++; i++; |
---|
| 257 | } |
---|
| 258 | while ( k < 30 ) { |
---|
| 259 | convert62( 0, m, sptr ); |
---|
| 260 | sptr += m; |
---|
| 261 | k++; |
---|
| 262 | } |
---|
| 263 | outfile << outstr << endl; |
---|
[65efd3] | 264 | } |
---|
| 265 | outfile.close(); |
---|
| 266 | |
---|
| 267 | delete [] outstr; |
---|
| 268 | delete [] T; |
---|
| 269 | delete [] table; |
---|
| 270 | |
---|
| 271 | cerr << endl; |
---|
| 272 | } |
---|
| 273 | //}}} |
---|
| 274 | |
---|
| 275 | int |
---|
| 276 | main() |
---|
| 277 | { |
---|
| 278 | int i, p, q, n; |
---|
| 279 | for ( i = 0; i < primes_len; i++ ) { |
---|
[806c18] | 280 | p = primes[i]; |
---|
| 281 | q = p*p; |
---|
| 282 | n = 2; |
---|
| 283 | setCharacteristic( p ); |
---|
| 284 | while ( q < maxtable ) { |
---|
| 285 | CanonicalForm f = findGen( n, q ); |
---|
| 286 | ASSERT( f != 0, "no generator found" ); |
---|
| 287 | printTable( n, q, f ); |
---|
| 288 | n++; q *= p; |
---|
| 289 | } |
---|
[65efd3] | 290 | } |
---|
| 291 | } |
---|