1 : /* crypto/sha/sha256.c */
2 : /* ====================================================================
3 : * Copyright (c) 2004 The OpenSSL Project. All rights reserved
4 : * according to the OpenSSL license [found in ./md32_common.h].
5 : * ====================================================================
6 : */
7 :
8 : #include <stdlib.h>
9 : #include <string.h>
10 :
11 : #include "sha256.h"
12 :
13 : int SHA224_Init (SHA256_CTX *c)
14 0 : {
15 0 : c->h[0]=0xc1059ed8UL; c->h[1]=0x367cd507UL;
16 0 : c->h[2]=0x3070dd17UL; c->h[3]=0xf70e5939UL;
17 0 : c->h[4]=0xffc00b31UL; c->h[5]=0x68581511UL;
18 0 : c->h[6]=0x64f98fa7UL; c->h[7]=0xbefa4fa4UL;
19 0 : c->Nl=0; c->Nh=0;
20 0 : c->num=0; c->md_len=SHA224_DIGEST_LENGTH;
21 0 : return 1;
22 : }
23 :
24 : int SHA256_Init (SHA256_CTX *c)
25 6818 : {
26 6818 : c->h[0]=0x6a09e667UL; c->h[1]=0xbb67ae85UL;
27 6818 : c->h[2]=0x3c6ef372UL; c->h[3]=0xa54ff53aUL;
28 6818 : c->h[4]=0x510e527fUL; c->h[5]=0x9b05688cUL;
29 6818 : c->h[6]=0x1f83d9abUL; c->h[7]=0x5be0cd19UL;
30 6818 : c->Nl=0; c->Nh=0;
31 6818 : c->num=0; c->md_len=SHA256_DIGEST_LENGTH;
32 6818 : return 1;
33 : }
34 :
35 : unsigned char *SHA224(const unsigned char *d, size_t n, unsigned char *md)
36 0 : {
37 : SHA256_CTX c;
38 : static unsigned char m[SHA224_DIGEST_LENGTH];
39 :
40 0 : if (md == NULL) md=m;
41 0 : SHA224_Init(&c);
42 0 : SHA256_Update(&c,d,n);
43 0 : SHA256_Final(md,&c);
44 0 : return(md);
45 : }
46 :
47 : unsigned char *SHA256(const unsigned char *d, size_t n, unsigned char *md)
48 0 : {
49 : SHA256_CTX c;
50 : static unsigned char m[SHA256_DIGEST_LENGTH];
51 :
52 0 : if (md == NULL) md=m;
53 0 : SHA256_Init(&c);
54 0 : SHA256_Update(&c,d,n);
55 0 : SHA256_Final(md,&c);
56 0 : return(md);
57 : }
58 :
59 : int SHA224_Update(SHA256_CTX *c, const void *data, size_t len)
60 0 : { return SHA256_Update (c,data,len); }
61 : int SHA224_Final (unsigned char *md, SHA256_CTX *c)
62 0 : { return SHA256_Final (md,c); }
63 :
64 : #define DATA_ORDER_IS_BIG_ENDIAN
65 :
66 : #define HASH_LONG uint32_t
67 : #define HASH_LONG_LOG2 2
68 : #define HASH_CTX SHA256_CTX
69 : #define HASH_CBLOCK SHA_CBLOCK
70 : #define HASH_LBLOCK SHA_LBLOCK
71 : /*
72 : * Note that FIPS180-2 discusses "Truncation of the Hash Function Output."
73 : * default: case below covers for it. It's not clear however if it's
74 : * permitted to truncate to amount of bytes not divisible by 4. I bet not,
75 : * but if it is, then default: case shall be extended. For reference.
76 : * Idea behind separate cases for pre-defined lenghts is to let the
77 : * compiler decide if it's appropriate to unroll small loops.
78 : */
79 : #define HASH_MAKE_STRING(c,s) do { \
80 : unsigned long ll; \
81 : unsigned int n; \
82 : switch ((c)->md_len) \
83 : { case SHA224_DIGEST_LENGTH: \
84 : for (n=0;n<SHA224_DIGEST_LENGTH/4;n++) \
85 : { ll=(c)->h[n]; HOST_l2c(ll,(s)); } \
86 : break; \
87 : case SHA256_DIGEST_LENGTH: \
88 : for (n=0;n<SHA256_DIGEST_LENGTH/4;n++) \
89 : { ll=(c)->h[n]; HOST_l2c(ll,(s)); } \
90 : break; \
91 : default: \
92 : if ((c)->md_len > SHA256_DIGEST_LENGTH) \
93 : return 0; \
94 : for (n=0;n<(c)->md_len/4;n++) \
95 : { ll=(c)->h[n]; HOST_l2c(ll,(s)); } \
96 : break; \
97 : } \
98 : } while (0)
99 :
100 : #define HASH_UPDATE SHA256_Update
101 : #define HASH_TRANSFORM SHA256_Transform
102 : #define HASH_FINAL SHA256_Final
103 : #define HASH_BLOCK_HOST_ORDER sha256_block_host_order
104 : #define HASH_BLOCK_DATA_ORDER sha256_block_data_order
105 : void sha256_block_host_order (SHA256_CTX *ctx, const void *in, size_t num);
106 : void sha256_block_data_order (SHA256_CTX *ctx, const void *in, size_t num);
107 :
108 : #include "md32_common.h"
109 :
110 : static const uint32_t K256[64] = {
111 : 0x428a2f98UL,0x71374491UL,0xb5c0fbcfUL,0xe9b5dba5UL,
112 : 0x3956c25bUL,0x59f111f1UL,0x923f82a4UL,0xab1c5ed5UL,
113 : 0xd807aa98UL,0x12835b01UL,0x243185beUL,0x550c7dc3UL,
114 : 0x72be5d74UL,0x80deb1feUL,0x9bdc06a7UL,0xc19bf174UL,
115 : 0xe49b69c1UL,0xefbe4786UL,0x0fc19dc6UL,0x240ca1ccUL,
116 : 0x2de92c6fUL,0x4a7484aaUL,0x5cb0a9dcUL,0x76f988daUL,
117 : 0x983e5152UL,0xa831c66dUL,0xb00327c8UL,0xbf597fc7UL,
118 : 0xc6e00bf3UL,0xd5a79147UL,0x06ca6351UL,0x14292967UL,
119 : 0x27b70a85UL,0x2e1b2138UL,0x4d2c6dfcUL,0x53380d13UL,
120 : 0x650a7354UL,0x766a0abbUL,0x81c2c92eUL,0x92722c85UL,
121 : 0xa2bfe8a1UL,0xa81a664bUL,0xc24b8b70UL,0xc76c51a3UL,
122 : 0xd192e819UL,0xd6990624UL,0xf40e3585UL,0x106aa070UL,
123 : 0x19a4c116UL,0x1e376c08UL,0x2748774cUL,0x34b0bcb5UL,
124 : 0x391c0cb3UL,0x4ed8aa4aUL,0x5b9cca4fUL,0x682e6ff3UL,
125 : 0x748f82eeUL,0x78a5636fUL,0x84c87814UL,0x8cc70208UL,
126 : 0x90befffaUL,0xa4506cebUL,0xbef9a3f7UL,0xc67178f2UL };
127 :
128 : /*
129 : * FIPS specification refers to right rotations, while our ROTATE macro
130 : * is left one. This is why you might notice that rotation coefficients
131 : * differ from those observed in FIPS document by 32-N...
132 : */
133 : #define Sigma0(x) (ROTATE((x),30) ^ ROTATE((x),19) ^ ROTATE((x),10))
134 : #define Sigma1(x) (ROTATE((x),26) ^ ROTATE((x),21) ^ ROTATE((x),7))
135 : #define sigma0(x) (ROTATE((x),25) ^ ROTATE((x),14) ^ ((x)>>3))
136 : #define sigma1(x) (ROTATE((x),15) ^ ROTATE((x),13) ^ ((x)>>10))
137 :
138 : #define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
139 : #define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
140 :
141 : #define ROUND_00_15(i,a,b,c,d,e,f,g,h) do { \
142 : T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i]; \
143 : h = Sigma0(a) + Maj(a,b,c); \
144 : d += T1; h += T1; } while (0)
145 :
146 : #define ROUND_16_63(i,a,b,c,d,e,f,g,h,X) do { \
147 : s0 = X[(i+1)&0x0f]; s0 = sigma0(s0); \
148 : s1 = X[(i+14)&0x0f]; s1 = sigma1(s1); \
149 : T1 = X[(i)&0x0f] += s0 + s1 + X[(i+9)&0x0f]; \
150 : ROUND_00_15(i,a,b,c,d,e,f,g,h); } while (0)
151 :
152 : static void sha256_block (SHA256_CTX *ctx, const void *in, size_t num, int host)
153 15801 : {
154 : uint32_t a,b,c,d,e,f,g,h,s0,s1,T1;
155 : uint32_t X[16];
156 : int i;
157 15801 : const unsigned char *data=in;
158 :
159 65174 : while (num--) {
160 :
161 33572 : a = ctx->h[0]; b = ctx->h[1]; c = ctx->h[2]; d = ctx->h[3];
162 33572 : e = ctx->h[4]; f = ctx->h[5]; g = ctx->h[6]; h = ctx->h[7];
163 :
164 33572 : if (host)
165 : {
166 14077 : const uint32_t *W=(const uint32_t *)data;
167 :
168 14077 : T1 = X[0] = W[0]; ROUND_00_15(0,a,b,c,d,e,f,g,h);
169 14077 : T1 = X[1] = W[1]; ROUND_00_15(1,h,a,b,c,d,e,f,g);
170 14077 : T1 = X[2] = W[2]; ROUND_00_15(2,g,h,a,b,c,d,e,f);
171 14077 : T1 = X[3] = W[3]; ROUND_00_15(3,f,g,h,a,b,c,d,e);
172 14077 : T1 = X[4] = W[4]; ROUND_00_15(4,e,f,g,h,a,b,c,d);
173 14077 : T1 = X[5] = W[5]; ROUND_00_15(5,d,e,f,g,h,a,b,c);
174 14077 : T1 = X[6] = W[6]; ROUND_00_15(6,c,d,e,f,g,h,a,b);
175 14077 : T1 = X[7] = W[7]; ROUND_00_15(7,b,c,d,e,f,g,h,a);
176 14077 : T1 = X[8] = W[8]; ROUND_00_15(8,a,b,c,d,e,f,g,h);
177 14077 : T1 = X[9] = W[9]; ROUND_00_15(9,h,a,b,c,d,e,f,g);
178 14077 : T1 = X[10] = W[10]; ROUND_00_15(10,g,h,a,b,c,d,e,f);
179 14077 : T1 = X[11] = W[11]; ROUND_00_15(11,f,g,h,a,b,c,d,e);
180 14077 : T1 = X[12] = W[12]; ROUND_00_15(12,e,f,g,h,a,b,c,d);
181 14077 : T1 = X[13] = W[13]; ROUND_00_15(13,d,e,f,g,h,a,b,c);
182 14077 : T1 = X[14] = W[14]; ROUND_00_15(14,c,d,e,f,g,h,a,b);
183 14077 : T1 = X[15] = W[15]; ROUND_00_15(15,b,c,d,e,f,g,h,a);
184 :
185 14077 : data += SHA256_CBLOCK;
186 : }
187 : else
188 : {
189 : uint32_t l;
190 :
191 19495 : HOST_c2l(data,l); T1 = X[0] = l; ROUND_00_15(0,a,b,c,d,e,f,g,h);
192 19495 : HOST_c2l(data,l); T1 = X[1] = l; ROUND_00_15(1,h,a,b,c,d,e,f,g);
193 19495 : HOST_c2l(data,l); T1 = X[2] = l; ROUND_00_15(2,g,h,a,b,c,d,e,f);
194 19495 : HOST_c2l(data,l); T1 = X[3] = l; ROUND_00_15(3,f,g,h,a,b,c,d,e);
195 19495 : HOST_c2l(data,l); T1 = X[4] = l; ROUND_00_15(4,e,f,g,h,a,b,c,d);
196 19495 : HOST_c2l(data,l); T1 = X[5] = l; ROUND_00_15(5,d,e,f,g,h,a,b,c);
197 19495 : HOST_c2l(data,l); T1 = X[6] = l; ROUND_00_15(6,c,d,e,f,g,h,a,b);
198 19495 : HOST_c2l(data,l); T1 = X[7] = l; ROUND_00_15(7,b,c,d,e,f,g,h,a);
199 19495 : HOST_c2l(data,l); T1 = X[8] = l; ROUND_00_15(8,a,b,c,d,e,f,g,h);
200 19495 : HOST_c2l(data,l); T1 = X[9] = l; ROUND_00_15(9,h,a,b,c,d,e,f,g);
201 19495 : HOST_c2l(data,l); T1 = X[10] = l; ROUND_00_15(10,g,h,a,b,c,d,e,f);
202 19495 : HOST_c2l(data,l); T1 = X[11] = l; ROUND_00_15(11,f,g,h,a,b,c,d,e);
203 19495 : HOST_c2l(data,l); T1 = X[12] = l; ROUND_00_15(12,e,f,g,h,a,b,c,d);
204 19495 : HOST_c2l(data,l); T1 = X[13] = l; ROUND_00_15(13,d,e,f,g,h,a,b,c);
205 19495 : HOST_c2l(data,l); T1 = X[14] = l; ROUND_00_15(14,c,d,e,f,g,h,a,b);
206 19495 : HOST_c2l(data,l); T1 = X[15] = l; ROUND_00_15(15,b,c,d,e,f,g,h,a);
207 : }
208 :
209 235004 : for (i=16;i<64;i+=8)
210 : {
211 201432 : ROUND_16_63(i+0,a,b,c,d,e,f,g,h,X);
212 201432 : ROUND_16_63(i+1,h,a,b,c,d,e,f,g,X);
213 201432 : ROUND_16_63(i+2,g,h,a,b,c,d,e,f,X);
214 201432 : ROUND_16_63(i+3,f,g,h,a,b,c,d,e,X);
215 201432 : ROUND_16_63(i+4,e,f,g,h,a,b,c,d,X);
216 201432 : ROUND_16_63(i+5,d,e,f,g,h,a,b,c,X);
217 201432 : ROUND_16_63(i+6,c,d,e,f,g,h,a,b,X);
218 201432 : ROUND_16_63(i+7,b,c,d,e,f,g,h,a,X);
219 : }
220 :
221 33572 : ctx->h[0] += a; ctx->h[1] += b; ctx->h[2] += c; ctx->h[3] += d;
222 33572 : ctx->h[4] += e; ctx->h[5] += f; ctx->h[6] += g; ctx->h[7] += h;
223 :
224 : }
225 15801 : }
226 :
227 : /*
228 : * Idea is to trade couple of cycles for some space. On IA-32 we save
229 : * about 4K in "big footprint" case. In "small footprint" case any gain
230 : * is appreciated:-)
231 : */
232 : void HASH_BLOCK_HOST_ORDER (SHA256_CTX *ctx, const void *in, size_t num)
233 14077 : { sha256_block (ctx,in,num,1); }
234 :
235 : void HASH_BLOCK_DATA_ORDER (SHA256_CTX *ctx, const void *in, size_t num)
236 1724 : { sha256_block (ctx,in,num,0); }
237 :
238 :
|
