/*
  Author:  Pate Williams (c) 1997

  Example 11.1
  "Suppose that p = 17, t = 3, and w = 5; and
  the public x-co-ordinates are x[i] = i,
  1 <= i <= 5. Suppose that
  B = {P[1], P[3], P[5]}, pool their shares,
  which are respectively 8, 10, and 11.
  Determine the key." -Douglas R. Stinson-
  See "Cryptography: Theory and Practice" by
  Douglas R. Stinson page 329.
*/

#include <stdio.h>
#include <stdlib.h>

#define SIZE 256

long Extended_Euclidean(long b, long n)
{
  long b0 = b, n0 = n, t = 1, t0 = 0, temp, q, r;

  q = n0 / b0;
  r = n0 - q * b0;
  while (r > 0) {
    temp = t0 - q * t;
    if (temp >= 0) temp = temp % n;
    else temp = n - (- temp % n);
    t0 = t;
    t = temp;
    n0 = b0;
    b0 = r;
    q = n0 / b0;
    r = n0 - q * b0;
  }
  if (b0 != 1) return 0;
  else return t % n;
}

long Lagrange(long p, long t, long *x, long *y)
/* computes the key using the Lagrange
   interpolation formula, returns the key */
{
  long bj, i, j, k, s = 0;

  for (j = 0; j < t; j++) {
    bj = 1;
    for (k = 0; k < t; k++) {
      if (j != k) {
        i = (x[k] - x[j]) % p;
        if (i < 0) i += p;
        bj = (((bj * x[k]) % p) * Extended_Euclidean(i, p)) % p;
      }
    }
    s = (s + (bj * y[j]) % p) % p;
  }
  if (s < 0) s += p;
  return s;
}

long share(long p, long t, long x, long *a)
{
  long j, s;

  s = a[t - 1];
  for (j = t - 2; j >= 0; j--)
    s = ((s * x) % p + a[j]) % p;
  if (s < 0) s += p;
  return s;
}

long **create_square_matrix(long n)
{
  long i, **matrix = calloc(n, sizeof(long *));

  if (!matrix) {
    fprintf(stderr, "fatal error\ninsufficient memory\n");
    fprintf(stderr, "from create_matrix\n");
    exit(1);
  }
  for (i = 0; i < n; i++) {
    matrix[i] = calloc(n, sizeof(long));
    if (!matrix[i]) {
      fprintf(stderr, "fatal error\ninsufficient memory\n");
      fprintf(stderr, "from create_matrix\n");
      exit(1);
    }
  }
  return matrix;
}

void delete_square_matrix(long n, long **matrix)
{
  long i;

  for (i = 0; i < n; i++) free(matrix[i]);
  free(matrix);
}

void Euclid_extended(long a, long b, long *u,
                     long *v, long *d)
{
  long q, t1, t3, v1, v3;

  *u = 1, *d = a;
  if (b == 0) {
    *v = 0;
    return;
  }
  v1 = 0, v3 = b;
  while (v3 != 0) {
    q = *d / v3;
    t3 = *d - q * v3;
    t1 = *u - q * v1;
    *u = v1, *d = v3;
    v1 = t1, v3 = t3;
  }
  *v = (*d - a * *u) / b;
}

long inv(long number, long modulus)
{
  long d, u, v;

  Euclid_extended(number, modulus, &u, &v, &d);
  if (d == 1) return u;
  return 0;
}

void gaussian_elimination(long n, long p,
                          long *b, long *x,
                          long **m)
{
  int found;
  long *d = calloc(n, sizeof(long)), ck, dj;
  long i, j, k, l, sum, t;

  if (!d) {
    fprintf(stderr, "fatal error\ninsufficient memory\n");
    fprintf(stderr, "from gaussian_elimination\n");
    exit(1);
  }
  for (j = 0; j < n; j++) {
    found = 0, i = j;
    while (!found && i < n) {
      found = m[i][j] != 0;
      if (!found) i++;
    }
    if (!found) {
      fprintf(stderr, "fatal error\nnon-invertible matrix\n");
      fprintf(stderr, "from gaussian_elimination\n");
      for (k = 0; k < n; k++) {
        for (l = 0; l < n; l++)
          printf("%ld ", m[k][l]);
        printf("\n");
      }
      exit(1);
    }
    if (i > j) {
      /* swap elements */
      for (l = j; l < n; l++)
        t = m[i][l], m[i][l] = m[j][l], m[j][l] = t;
      t = b[i], b[i] = b[j], b[j] = t;
    }
    dj = d[j] = inv(m[j][j], p);
    if (dj == 0) {
      fprintf(stderr, "fatal error\nnon-invertlible element\n");
      fprintf(stderr, "from gaussian elimination");
      fprintf(stderr, "element %ld mod %ld\n", m[j][j], p);
      exit(1);
    }
    for (k = j + 1; k < n; k++) {
      ck = (dj * m[k][j]) % p;
      for (l = j + 1; l < n; l++) {
        m[k][l] = (m[k][l] - ck * m[j][l]) % p;
        if (m[k][l] < 0) m[k][l] += p;
      }
      b[k] = (b[k] - ck * b[j]) % p;
      if (b[k] < 0) b[k] += p;
    }
  }
  for (i = n - 1; i >= 0; i--) {
    sum = 0;
    for (j = i + 1; j < n; j++)
      sum += (m[i][j] * x[j]) % p;
    if (sum < 0) sum += p;
    x[i] = (d[i] * (b[i] - sum)) % p;
    if (x[i] < 0) x[i] += p;
  }
}

void solve(long p, long t, long *a, long *x, long *y)
{
  long i, j, k, q, z;
  long **A = create_square_matrix(t);

  for (i = 0; i < t; i++) {
    z = x[i];
    for (j = 0; j < t; j++) {
      q = 1;
      for (k = 1; k <= j; k++) q = (q * z) % p;
      A[i][j] = q;
    }
  }
  printf("the matrix is:\n");
  for (i = 0; i < t; i++) {
    for (j = 0; j < t; j++)
      printf("%5ld ", A[i][j]);
    printf("\n");
  }
  gaussian_elimination(t, p, y, a, A);
  delete_square_matrix(t, A);
}

int main(void)
{
  long i, p = 17, s, t = 3;
  long a[3];
  long x[3] = {1, 3, 5};
  long y[3] = {8, 10, 11};
  long z[3] = {8, 10, 11};

  printf("====\n");
  printf("x  y\n");
  printf("====\n");
  for (i = 0; i < 3; i++)
    printf("%ld %2ld\n", x[i], y[i]);
  printf("====\n");
  printf("key = %ld\n", Lagrange(p, t, x, y));
  solve(p, t, a, x, y);
  for (i = 0; i < t; i++)
    printf("a[%ld] = %ld\n", i, a[i]);
  for (i = 0; i < t; i++) {
    s = share(p, t, x[i], a);
    if (s != z[i]) {
      printf("*error*\nin calculation of share %ld\n", i + 1);
      printf("%ld %ld\n", s, y[i]);
    }
  }
  return 0;
}