large-gf/main64.c at master · robdockins/large-gf · GitHub

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
#include <stdlib.h>
#include <stdio.h>

#include "gf2_16.h"
#include "gf2_64.h"

//const unsigned long MAX_ROUNDS = 100000;
const unsigned long MAX_ROUNDS = 100000000;
//const unsigned long MAX_ROUNDS = 1000000000;

const uint64_t w64_prim = 0b11011L;

uint64_t advance( uint64_t x ) {
  if( x & (1L << 63) ) {
    return (x << 1) ^ w64_prim;
  } else {
    return x << 1;
  }
}


/*
int main_asdf() {
  uint64_t x = 0x1;
  uint64_t y = 0x1;

  for(int i=0; i<128; i++) {
    uint64_t fx = gf2_64_iso(x);
    if( fx == y ) {
    } else {
      printf( "Failed at %d\n", i );
      printf( "  x   = 0x%.16llx\n", x );
      printf( "  y   = 0x%.16llx\n", y );
      printf( " f(x) = 0x%.16llx\n", fx );
    }

    x = advance(x);
    y = gf2_64_mult( y, gf2_64_generator );
  }

  return 0;
}
*/


/*   for(uint64_t i=0;i<64; i++) { */
/*     uint64_t x = gf2_64_pow( gf2_64_generator, i ); */
/*     printf( "  x = 0x%.16llx\n", x ); */
/*   } */
/* } */

#if 1
int main() {
  unsigned int randreg;
  FILE* urand = fopen("/dev/urandom", "r");
  fread( &randreg, sizeof(randreg), 1, urand );
  fclose(urand);
  //randreg = 0x1650338b;
  printf( "randreg = %#.8x\n", randreg );

  uint64_t i;
  for( i = 0; i < MAX_ROUNDS; i++ ) {
    uint64_t x, y, z;

    x = (uint64_t) rand_r( &randreg );
    x <<= 32;
    x |= (uint64_t) rand_r( &randreg );

    //y = (uint64_t) rand_r( &randreg );
    //y <<= 32;
    //y |= (uint64_t) rand_r( &randreg );

    //z = (uint64_t) rand_r( &randreg );
    //z <<= 32;
    //z |= (uint64_t) rand_r( &randreg );

    /*
    z  = gf2_64_pow( x, 64 );
    z ^= gf2_64_pow( x,  4 );
    z ^= gf2_64_pow( x,  3 );
    z ^= x;

    if( z == 1 ) {
      printf( "Isomorphism generator?:\n" );
      printf( "  z = 0x%.16llx\n", z );
    }
    */

    /*
    // Distrbutivity test
    if( gf2_64_mult( x, y ^ z ) ==
        (gf2_64_mult( x, y ) ^ gf2_64_mult( x, z )) ) {
    } else {
      printf( "Distributivity fail:\n" );
      printf( "  x = 0x%.16llx\n", x );
      printf( "  y = 0x%.16llx\n", y );
      printf( "  z = 0x%.16llx\n", z );
    }

    // Associativity test
    if( gf2_64_mult( x, gf2_64_mult( y, z ) ) ==
        gf2_64_mult( gf2_64_mult( x, y ), z ) ) {
    } else {
      printf( "Associativity fail:\n" );
      printf( "  x = 0x%.16llx\n", x );
      printf( "  y = 0x%.16llx\n", y );
      printf( "  z = 0x%.16llx\n", z );
    }

    // Commutitivity test
    if( gf2_64_mult( x, y ) == gf2_64_mult( y, x ) ) {
    } else {
      printf( "Commutivity fail:\n" );
      printf( "  x = 0x%.16llx\n", x );
      printf( "  y = 0x%.16llx\n", y );
    }

    // squaring test
    if( gf2_64_mult( x, x ) == gf2_64_square( x ) ) {
    } else {
      printf( "Squaring fail:\n" );
      printf( "  x = 0x%.16llx\n", x );
    }
    */

    // inverse test
    if( x == 0 || (gf2_64_mult( x, gf2_64_inv( x ) ) == 1) ) {
    } else {
      printf( "Inversion fail:\n" );
      printf( "  x = 0x%.16llx\n", x );
    }

    /*
    // inverse test
    if( x == 0 || gf2_64_inv( x ) != 0) {
    } else {
      printf( "Inversion fail:\n" );
      printf( "  x = 0x%.16llx\n", x );
    }
    */

    /* power test */
    /* if( gf2_64_pow_alternate( x, y ) == gf2_64_pow ( x, y ) ) { */
    /* } else { */
    /*   printf( "Power fail:\n" ); */
    /*   printf( "  x = 0x%.16llx\n", x ); */
    /*   printf( "  y = 0x%.16llx\n", y ); */
    /* } */

    /*
    if( gf2_64_generator( x ) ) {
      printf( "Group generator\n" );
      printf( "   x = 0x%.16llx\n", x );
    }
    */
  }

  printf( "%lu Tests completed\n", MAX_ROUNDS );
  return 0;
}
#endif