How to vectorize Mersenne Twister loops over arrays

Question

Currently i'm working with an custom implementation of the Mersenne Twister, and i'd like to improve my understanding of vector operations.

I have the following code:

#define N 624
#define M 397

 for( k = N -1; k; k-- )
 {
    array[i] = (array[i] ^ ((array[i-1] ^ (array[i-1] >> 30)) * 1566083941UL)) - i;
    array[i] &= 0xffffffffUL;
    ++i;

    if ( i >= N )
    {
        array[0] = array[N-1];
        i = 1;
    }
 }

Here i'm working with 32 bit integers only, so as i understand, I could perform 8 times as much operations at the same time, using AVX2 instructions? How can I do that in practice?

I know how to deal with addition of 2 vectors, but this case seems to be more complicated. I don't know how to begin.

For a scalar approach i'd work like that, but i'd like to get sure how to perform these actions in my case.

 for (i = 0; i < 1024; i++)
 {
    C[i] = A[i]*B[i];
 }



for (i = 0; i < 1024; i+=4)
  {
     C[i:i+3] = A[i:i+3]*B[i:i+3];
  }

Unfortunately at my university there are no lessons about intrinsics, but i'm quite curious in order to get an improvement.

I'm also doing some thoughts, about how to create the array using vectors? Maybe matrix? (Maybe _mm256_setr_epi32)

I hope to get some advice regarding this topic!