}
}
-
+inline uchar circ(uchar x,int n) {return (x << n) | (x >> (8 - n));}
//the proposed hash function, which is based on DSD structure. Sensitivity is ensured by employing the binary diffusion
for(int a=0;a<h;a+=4) {
Y[a]=Sbox1[Y[a]];
+ //Y[a]=circ(Y[a],3);
}
Z[h-1]=Y[h-1]^Y[0];
for(int a=0;a<h;a+=4) {
Z[a]=Sbox2[Z[a]];
+ //Z[a]=circ(Z[a],7);
}
time+=TimeStop(t);
cout<<"Hash Time "<<time<<endl;
-
+ cout<<(double)imsize*nb_test/time<<"\t";
for(int i=0;i<h;i++){
cout<<(int)RM1[i]<<" ";