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

/**
* mix functions
* @param in array of pointer to uint32_t so that we could alter their value
*/
void mix(uint32_t ** in) {
uint32_t a = *(in[0]);
uint32_t b = *(in[1]);
uint32_t c = *(in[2]);
uint32_t d = *(in[3]);

a = a + b;

// d = (a xor d) >>> 8
uint32_t a_xor_d = a ^ d;
d = (a_xor_d >> 8) | (a_xor_d << (32 - 8));

c = c + d;

//b = (b xor c) >>> 11
uint32_t b_xor_c = b ^ c;
b = (b_xor_c >> 11) | (b_xor_c << (32 - 11));

a = a + b;

//d = (a xor d) >>> 16
a_xor_d = a ^ d;
d = (a_xor_d >> 16) | (a_xor_d << (32 - 16));

c = c + d;

//b = (b xor c) >>> 31
b_xor_c = b ^ c;
b = (b_xor_c >> 31) | (b_xor_c << (32 - 31));

*(in[0]) = a;
*(in[1]) = b;
*(in[2]) = c;
*(in[3]) = d;
}

void round_(uint32_t * t) {
uint32_t ** in = (uint32_t **) calloc(4, sizeof (uint32_t *));
// (t0, t4, t8, t12) = mix(t0, t4, t8, t12)
// (t1, t5, t9, t13) = mix(t1, t5, t9, t13)
// (t2, t6, t10, t14) = mix(t2, t6, t10, t14)
// (t3, t7, t11, t15) = mix(t3, t7, t11, t15)
int i;
for (i = 0; i <= 3; i++) {
   in[0] = &(t[i]);
   in[1] = &(t[i + 4]);
   in[2] = &(t[i + 8]);
   in[3] = &(t[i + 12]);
   mix(in);
}

1. Let P be a prime that has 1024 bits and let a be a primitive roo...