tcg/multiarch/sha1.c

6 SHA-1 in C
10 Test Vectors (from FIPS PUB 180-1)
12   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
15 A million repetitions of "a"
30 SHA-1 in C
47 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
52 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
53     |(rol(block->l[i],8)&0x00FF00FF))
55 #define blk0(i) block->l[i]
59 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
60     ^block->l[(i+2)&15]^block->l[i&15],1))
63 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);  argument
64 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);  argument
65 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);  argument
66 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);  argument
67 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);  argument
70 /* Hash a single 512-bit block. This is the core of the algorithm. */
74 uint32_t a, b, c, d, e;  in SHA1Transform()  local
80 CHAR64LONG16 block[1];  /* use array to appear as a pointer */  in SHA1Transform()
84      * pointer-to-const buffer to be cast into a pointer to non-const.  in SHA1Transform()
85      * And the result is written through.  I threw a "const" in, hoping  in SHA1Transform()
86      * this will cause a diagnostic.  in SHA1Transform()
90     /* Copy context->state[] to working vars */  in SHA1Transform()
91     a = state[0];  in SHA1Transform()
97     R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);  in SHA1Transform()
98     R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);  in SHA1Transform()
99     R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);  in SHA1Transform()
100     R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);  in SHA1Transform()
101     R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);  in SHA1Transform()
102     R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);  in SHA1Transform()
103     R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);  in SHA1Transform()
104     R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);  in SHA1Transform()
105     R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);  in SHA1Transform()
106     R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);  in SHA1Transform()
107     R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);  in SHA1Transform()
108     R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);  in SHA1Transform()
109     R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);  in SHA1Transform()
110     R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);  in SHA1Transform()
111     R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);  in SHA1Transform()
112     R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);  in SHA1Transform()
113     R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);  in SHA1Transform()
114     R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);  in SHA1Transform()
115     R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);  in SHA1Transform()
116     R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);  in SHA1Transform()
118     state[0] += a;  in SHA1Transform()
124     a = b = c = d = e = 0;  in SHA1Transform()
126     memset(block, '\0', sizeof(block));  in SHA1Transform()
131 /* SHA1Init - Initialize new context */
136     context->state[0] = 0x67452301;  in SHA1Init()
137     context->state[1] = 0xEFCDAB89;  in SHA1Init()
138     context->state[2] = 0x98BADCFE;  in SHA1Init()
139     context->state[3] = 0x10325476;  in SHA1Init()
140     context->state[4] = 0xC3D2E1F0;  in SHA1Init()
141     context->count[0] = context->count[1] = 0;  in SHA1Init()
152     j = context->count[0];  in SHA1Update()
153     if ((context->count[0] += len << 3) < j)  in SHA1Update()
154         context->count[1]++;  in SHA1Update()
155     context->count[1] += (len>>29);  in SHA1Update()
158         memcpy(&context->buffer[j], data, (i = 64-j));  in SHA1Update()
159         SHA1Transform(context->state, context->buffer);  in SHA1Update()
161             SHA1Transform(context->state, &data[i]);  in SHA1Update()
163         j = 0;  in SHA1Update()
165     else i = 0;  in SHA1Update()
166     memcpy(&context->buffer[j], &data[i], len - i);  in SHA1Update()
178 #if 0	/* untested "improvement" by DHR */  in SHA1Final()
179     /* Convert context->count to a sequence of bytes  in SHA1Final()
181      * big-endian order within element.  in SHA1Final()
186     for (i = 0; i < 2; i++)  in SHA1Final()
188         uint32_t t = context->count[i];  in SHA1Final()
191         for (j = 0; j < 4; t >>= 8, j++)  in SHA1Final()
192             *--fcp = (unsigned char) t;  in SHA1Final()
195     for (i = 0; i < 8; i++) {  in SHA1Final()
196         finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]  in SHA1Final()
197          >> ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */  in SHA1Final()
202     while ((context->count[0] & 504) != 448) {  in SHA1Final()
206     SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */  in SHA1Final()
207     for (i = 0; i < 20; i++) {  in SHA1Final()
209          ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);  in SHA1Final()
212     memset(context, '\0', sizeof(*context));  in SHA1Final()
213     memset(&finalcount, '\0', sizeof(finalcount));  in SHA1Final()
226     for(i=0;i<BUFSIZE;i++)  in main()
230     for(i=0;i<1000;i++)  in main()
235     for(i=0;i<20;i++)  in main()
238     return 0;  in main()