2 //g++ -O3 one_round_hash_new.cpp pixmap_io.o -o one_round_hash_new -std=c++11
16 /*#include <cryptopp/hex.h>
17 #include <cryptopp/sha.h>
18 #include <cryptopp/osrng.h>
19 #include <cryptopp/secblock.h>
24 int load_RGB_pixmap(char *filename, int *width, int *height, unsigned char**R_data, unsigned char**G_data, unsigned char**B_data);
25 void store_RGB_pixmap(char *filename, unsigned char *R_data, unsigned char *G_data, unsigned char *B_data, int width, int height);
29 //using namespace CryptoPP;
43 typedef unsigned char uchar;
48 struct timeval tstart;
49 gettimeofday(&tstart,0);
50 return( (double) (tstart.tv_sec + tstart.tv_usec*1e-6) );
53 double TimeStop(double t)
57 gettimeofday(&tend,0);
58 t = (double) (tend.tv_sec + tend.tv_usec*1e-6) - t;
67 void inverse_tables(uchar *tab, int size_tab,uchar *inv_perm_tabs) {
69 for(int i=0;i<size_tab;i++) {
70 inv_perm_tabs[tab[i]] = i;
75 void inverse_tables_int(int *tab, int size_tab,int *inv_perm_tabs) {
77 for(int i=0;i<size_tab;i++) {
78 inv_perm_tabs[tab[i]] = i;
85 void rc4key(uchar *key, uchar *sc, int size_DK) {
87 for(int i=0;i<256;i++) {
93 for(int i0=0; i0<256; i0++) {
94 j0 = (j0 + sc[i0] + key[i0%size_DK] )&0xFF;
103 void rc4keyperm(uchar *key,int len, int rp,int *sc, int size_DK) {
109 for (int i=0;i<len;i++) {
112 for (int it = 0; it < rp; it++) {
114 for(int i0 = 0; i0<len; i0++) {
115 j0 = (j0 + sc[i0] + sc[j0] + key[i0%size_DK] )% len;
124 void prga(uchar *sc, uchar *X, int ldata, uchar *r, int h) {
128 for (int it=0; it<ldata; it++) {
129 i0 = X[(i0+1)&(h-1)];
134 r[it]=sc[i0];//sc[(sc[i0]+sc[j0])&255];
138 inline uchar circ(uchar x,int n) {return (x << n) | (x >> (8 - n));}
141 uint64_t xorshift64( const uint64_t state)
149 uint xorshift32(const uint t)
151 /* Algorithm "xor" from p. 4 of Marsaglia, "Xorshift RNGs" */
159 static inline uint64_t splitmix64(uint64_t index) {
160 uint64_t z = (index + UINT64_C(0x9E3779B97F4A7C15));
161 z = (z ^ (z >> 30)) * UINT64_C(0xBF58476D1CE4E5B9);
162 z = (z ^ (z >> 27)) * UINT64_C(0x94D049BB133111EB);
163 return z ^ (z >> 31);
172 //the proposed hash function, which is based on DSD structure. Sensitivity is ensured by employing the binary diffusion
174 void hash_DSD_BIN(uchar* seq_in, uchar* RM1,int len, uchar *S, int h) {
177 // Goal: Calculate the hash value
178 // Output: RM (hash value)
180 // uchar *X=new uchar[h2];
181 // uchar *fX=new uchar[h2];
186 uint32_t *rm=(uint32_t*)RM1;
187 uint32_t *xx=(uint32_t*)X;
188 uint32_t *ss=(uint32_t*)seq_in;
192 for(int it=0;it<len;it++) {
194 //ind2=Pbox[(it+len/2)]*h;
197 // Mix with dynamic RM
199 /* for(int a=0;a<h;a+=4) {
200 X[a]=RM1[a]^seq_in[ind1+a];
201 X[a+1]=RM1[a+1]^seq_in[ind1+a+1];
202 X[a+2]=RM1[a+2]^seq_in[ind1+a+2];
203 X[a+3]=RM1[a+3]^seq_in[ind1+a+3];
208 for(int a=0;a<h/4;a++) {
209 xx[a]=rm[a]^ss[ind1+a];
216 rm[0]=xorshift32(sum);
217 for(int a=1;a<h/4;a++) {
218 rm[a]^=xorshift32(rm[a-1]);
236 int main(int argc, char** argv) {
245 for(int i=1; i<argc; i++){
246 if(strncmp(argv[i],"nb",2)==0) nb_test = atoi(&(argv[i][2])); //nb of test
247 if(strncmp(argv[i],"h",1)==0) h = atoi(&(argv[i][1])); //size of block
248 if(strncmp(argv[i],"sizebuf",7)==0) size_buf = atoi(&(argv[i][7])); //SIZE of the buffer
249 if(strncmp(argv[i],"lena",4)==0) lena = atoi(&(argv[i][4])); //Use Lena or buffer
250 if(strncmp(argv[i],"c",1)==0) change = atoi(&(argv[i][1])); //Use Lena or buffer
254 cout<<size_buf<<endl;
255 int seed=12;//time(NULL);
259 uchar Secretkey[key_size];
261 uchar counter[key_size];
263 for(int i=0;i<key_size;i++) {
264 Secretkey[i]=lrand48()&0xFF;
265 counter[i]=lrand48()&0xFF;
277 uchar *data_R, *data_G, *data_B;
282 load_RGB_pixmap("lena.ppm", &width, &height, &data_R, &data_G, &data_B);
283 imsize=width*height*3;
284 // load_RGB_pixmap("No_ecb_mode_picture.ppm", &width, &height, &data_R, &data_G, &data_B);
288 buffer=new uchar[imsize];
289 for(int i=0;i<imsize;i++) {
297 uchar* seq= new uchar[imsize];
298 uchar* seq2= new uchar[imsize];
303 for(int i=0;i<oneD;i++) {
305 seq[oneD+i]=data_G[i];
306 seq[2*oneD+i]=data_B[i];
311 for(int i=0;i<oneD;i++) {
316 printf("seq 4 %d\n",seq[4]);
326 printf("seq 4 %d\n",seq[4]);
331 int total_len=imsize;
333 int len= total_len/h;
337 uchar *mix=new uchar[256];
342 for (int i = 0; i < 256 ; i++) {
343 mix[i]=Secretkey[i]^counter[i];
347 // cout<<"hash "<<endl;
348 for (int i = 0; i < 64 ; i++) {
351 //cout<<(int)DK[i]<<" ";
366 double t=TimeStart();
367 rc4key(DK, Sbox1, 8);
369 rc4key(&DK[16], sc, 8);
374 prga(sc, sc,h,RM1,h);
381 cout<<"Time initializaton "<<time<<endl;
385 cout<<"imsize "<<imsize<<endl;
387 /* for(int i=0;i<imsize;i++){
388 cout<<(int)seq[i]<<" ";
397 for(int i=0;i<nb_test;i++)
399 hash_DSD_BIN(seq, RM1,len,Sbox1,h);
406 cout<<"Hash Time "<<time<<endl;
407 cout<<(double)imsize*nb_test/time<<"\t";
409 for(int i=0;i<h;i++){
410 cout<<(int)RM1[i]<<" ";
414 // cout<<splitmix64(2490)<<endl;
415 // cout<<splitmix64(2489)<<endl;