Fri Nov 22 02:34:23 2024

Algorithmic Cryptanalysis (View it on amazon.com)

A CRC Press Book by Antoine Joux

Program 3.2: Matrix multiplication with compact encoding

Algorithmic cryptanalysis codes by Antoine Joux are licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported License.

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

#define DIM 32
#define WORD unsigned int
#define REPEAT 100000

#define bit(M,l,c) ((M[l]>>c)&1)
#define flipbit(M,l,c) if (1) {M[l]^=(1UL<<c);} else

void input_mat(WORD mat[DIM])
{
  int l,c,val;

  for (l=0;l<DIM;l++) {
    mat[l]=0;

    for (c=0;c<DIM;c++) {
      scanf("%d",&val);

      if (val) flipbit(mat,l,c);
    }
  }
}

void print_mat(WORD mat[DIM])
{
  int l,c;

  for (l=0;l<DIM;l++) {
    for (c=0;c<DIM;c++) {

      printf("%d ",bit(mat,l,c));
    }
    printf("\n");
  }
} 


void Mul(WORD res[DIM],WORD mat1[DIM],WORD mat2[DIM])
{

  int l,c,k,val;
  for (l=0;l<DIM;l++) {

    res[l]=0;
    for (c=0;c<DIM;c++) {

      val=0;
      for (k=0;k<DIM;k++) {

        val^=bit(mat1,l,k)&bit(mat2,k,c);
      }

      if (val) flipbit(res,l,c);
    }
  }
}

main()
{
  WORD mat1[DIM]; WORD mat2[DIM]; WORD mat3[DIM]; int count;

  printf("Input Mat1\n");  input_mat(mat1);
  printf("Input Mat2\n");  input_mat(mat2);

  for(count=0; count<REPEAT; count++) Mul(mat3,mat1,mat2);

  printf("Product :\n");  print_mat(mat3);
}

Credits for page styles: Dynamic Drive CSS Library