Using C language

The mixing step of our permutation takes four uint32_t variables, a/b/c/d, and updates them according to the following schematic. ai b d CS16 EK S512 The circles indicate XOR, the squares indicated addition, and the rectangles indicate rotate-left by the number of bits indicated (there are four of each operation in the picture). Implement the schematic using the starter code below. The fact that the parameters are of type (uint32_t *) means that pointers to uint32_t variables are being passed and not the variables themselves. This is how "call-by-reference" is acheived in C and how changes to variables outside of a function are achieved inside of a function. 1 #include 2 3- uint32_t rot132(uint32_t x, int n) { 4 return (x n) | (x >> (32-n)); 5} 6 7- void mixing(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d) { 8 9 } 10 | The mixing step of our permutation takes four uint32_t variables, a/b/c/d, and updates them according to the following schematic. ai b d CS16 EK S512 The circles indicate XOR, the squares indicated addition, and the rectangles indicate rotate-left by the number of bits indicated (there are four of each operation in the picture). Implement the schematic using the starter code below. The fact that the parameters are of type (uint32_t *) means that pointers to uint32_t variables are being passed and not the variables themselves. This is how "call-by-reference" is acheived in C and how changes to variables outside of a function are achieved inside of a function. 1 #include 2 3- uint32_t rot132(uint32_t x, int n) { 4 return (x n) | (x >> (32-n)); 5} 6 7- void mixing(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d) { 8 9 } 10 |