projects / u / mdw / catacomb / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
perftest: Document the `-q' option for disabling checking.
[u/mdw/catacomb] / sha512.c
1 /* -*-c-*-
2 *
3 * $Id: sha512.c,v 1.2 2004/04/08 01:36:15 mdw Exp $
4 *
5 * Implementation of the SHA-512 hash function
6 *
7 * (c) 2000 Straylight/Edgeware
8 */
9
10 /*----- Licensing notice --------------------------------------------------*
11 *
12 * This file is part of Catacomb.
13 *
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
18 *
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
23 *
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
27 * MA 02111-1307, USA.
28 */
29
30 /*----- Header files ------------------------------------------------------*/
31
32 #include <mLib/bits.h>
33
34 #include "ghash.h"
35 #include "ghash-def.h"
36 #include "hash.h"
37 #include "sha512.h"
38
39 /*----- Main code ---------------------------------------------------------*/
40
41 /* --- @sha512_compress@, @sha384_compress@ --- *
42 *
43 * Arguments: @sha512_ctx *ctx@ = pointer to context block
44 * @const void *sbuf@ = pointer to buffer of appropriate size
45 *
46 * Returns: ---
47 *
48 * Use: SHA-512 compression function.
49 */
50
51 void sha512_compress(sha512_ctx *ctx, const void *sbuf)
52 {
53 kludge64 a, b, c, d, e, f, g, h;
54 kludge64 buf[80];
55 int i;
56
57 static const kludge64 K[80] = {
58 X64(428a2f98, d728ae22), X64(71374491, 23ef65cd),
59 X64(b5c0fbcf, ec4d3b2f), X64(e9b5dba5, 8189dbbc),
60 X64(3956c25b, f348b538), X64(59f111f1, b605d019),
61 X64(923f82a4, af194f9b), X64(ab1c5ed5, da6d8118),
62 X64(d807aa98, a3030242), X64(12835b01, 45706fbe),
63 X64(243185be, 4ee4b28c), X64(550c7dc3, d5ffb4e2),
64 X64(72be5d74, f27b896f), X64(80deb1fe, 3b1696b1),
65 X64(9bdc06a7, 25c71235), X64(c19bf174, cf692694),
66 X64(e49b69c1, 9ef14ad2), X64(efbe4786, 384f25e3),
67 X64(0fc19dc6, 8b8cd5b5), X64(240ca1cc, 77ac9c65),
68 X64(2de92c6f, 592b0275), X64(4a7484aa, 6ea6e483),
69 X64(5cb0a9dc, bd41fbd4), X64(76f988da, 831153b5),
70 X64(983e5152, ee66dfab), X64(a831c66d, 2db43210),
71 X64(b00327c8, 98fb213f), X64(bf597fc7, beef0ee4),
72 X64(c6e00bf3, 3da88fc2), X64(d5a79147, 930aa725),
73 X64(06ca6351, e003826f), X64(14292967, 0a0e6e70),
74 X64(27b70a85, 46d22ffc), X64(2e1b2138, 5c26c926),
75 X64(4d2c6dfc, 5ac42aed), X64(53380d13, 9d95b3df),
76 X64(650a7354, 8baf63de), X64(766a0abb, 3c77b2a8),
77 X64(81c2c92e, 47edaee6), X64(92722c85, 1482353b),
78 X64(a2bfe8a1, 4cf10364), X64(a81a664b, bc423001),
79 X64(c24b8b70, d0f89791), X64(c76c51a3, 0654be30),
80 X64(d192e819, d6ef5218), X64(d6990624, 5565a910),
81 X64(f40e3585, 5771202a), X64(106aa070, 32bbd1b8),
82 X64(19a4c116, b8d2d0c8), X64(1e376c08, 5141ab53),
83 X64(2748774c, df8eeb99), X64(34b0bcb5, e19b48a8),
84 X64(391c0cb3, c5c95a63), X64(4ed8aa4a, e3418acb),
85 X64(5b9cca4f, 7763e373), X64(682e6ff3, d6b2b8a3),
86 X64(748f82ee, 5defb2fc), X64(78a5636f, 43172f60),
87 X64(84c87814, a1f0ab72), X64(8cc70208, 1a6439ec),
88 X64(90befffa, 23631e28), X64(a4506ceb, de82bde9),
89 X64(bef9a3f7, b2c67915), X64(c67178f2, e372532b),
90 X64(ca273ece, ea26619c), X64(d186b8c7, 21c0c207),
91 X64(eada7dd6, cde0eb1e), X64(f57d4f7f, ee6ed178),
92 X64(06f067aa, 72176fba), X64(0a637dc5, a2c898a6),
93 X64(113f9804, bef90dae), X64(1b710b35, 131c471b),
94 X64(28db77f5, 23047d84), X64(32caab7b, 40c72493),
95 X64(3c9ebe0a, 15c9bebc), X64(431d67c4, 9c100d4c),
96 X64(4cc5d4be, cb3e42b6), X64(597f299c, fc657e2a),
97 X64(5fcb6fab, 3ad6faec), X64(6c44198c, 4a475817)
98 };
99
100 /* --- Fetch the chaining variables --- */
101
102 a = ctx->a;
103 b = ctx->b;
104 c = ctx->c;
105 d = ctx->d;
106 e = ctx->e;
107 f = ctx->f;
108 g = ctx->g;
109 h = ctx->h;
110
111 /* --- Definitions for round functions --- */
112
113 #define CH(d, x, y, z) do { \
114 kludge64 _x; AND64((d), (x), (y)); CPL64(_x, (x)); \
115 AND64(_x, _x, (z)); OR64((d), (d), _x); \
116 } while (0)
117
118 #define MAJ(d, x, y, z) do { \
119 kludge64 _x; AND64((d), (x), (y)); AND64(_x, (x), (z)); \
120 OR64((d), (d), _x); AND64(_x, (y), (z)); OR64((d), (d), _x); \
121 } while (0)
122
123 #define SIGMA(d, x, i, j, k, last, what) do { \
124 kludge64 _x; ROR64_((d), (x), (i)); ROR64_(_x, (x), (j)); \
125 XOR64((d), (d), _x); last##64_(_x, (x), (k)); XOR64((d), (d), _x); \
126 } while (0)
127
128 #define S0(d, x) SIGMA(d, x, 28, 34, 39, ROR, S0);
129 #define S1(d, x) SIGMA(d, x, 14, 18, 41, ROR, S1);
130 #define s0(d, x) SIGMA(d, x, 1, 8, 7, LSR, s0);
131 #define s1(d, x) SIGMA(d, x, 19, 61, 6, LSR, s1);
132
133 #define T(a, b, c, d, e, f, g, h, i) do { \
134 kludge64 t1, t2, x; \
135 ADD64(t1, buf[i], K[i]); ADD64(t1, t1, h); \
136 S1(x, e); ADD64(t1, t1, x); CH(x, e, f, g); ADD64(t1, t1, x); \
137 S0(t2, a); MAJ(x, a, b, c); ADD64(t2, t2, x); \
138 ADD64(d, d, t1); ADD64(h, t1, t2); \
139 } while (0)
140
141 /* --- Fetch and expand the buffer contents --- */
142
143 {
144 const octet *p;
145
146 for (i = 0, p = sbuf; i < 16; i++, p += 8)
147 LOAD64_(buf[i], p);
148 for (i = 16; i < 80; i++) {
149 kludge64 x;
150 buf[i] = buf[i - 7]; s1(x, buf[i - 2]); ADD64(buf[i], buf[i], x);
151 s0(x, buf[i - 15]); ADD64(buf[i], buf[i], x);
152 ADD64(buf[i], buf[i], buf[i - 16]);
153 }
154 }
155
156 /* --- The main compression function --- */
157
158 for (i = 0; i < 80; i += 8) {
159 T(a, b, c, d, e, f, g, h, i + 0);
160 T(h, a, b, c, d, e, f, g, i + 1);
161 T(g, h, a, b, c, d, e, f, i + 2);
162 T(f, g, h, a, b, c, d, e, i + 3);
163 T(e, f, g, h, a, b, c, d, i + 4);
164 T(d, e, f, g, h, a, b, c, i + 5);
165 T(c, d, e, f, g, h, a, b, i + 6);
166 T(b, c, d, e, f, g, h, a, i + 7);
167 }
168
169 /* --- Update the chaining variables --- */
170
171 ADD64(ctx->a, ctx->a, a);
172 ADD64(ctx->b, ctx->b, b);
173 ADD64(ctx->c, ctx->c, c);
174 ADD64(ctx->d, ctx->d, d);
175 ADD64(ctx->e, ctx->e, e);
176 ADD64(ctx->f, ctx->f, f);
177 ADD64(ctx->g, ctx->g, g);
178 ADD64(ctx->h, ctx->h, h);
179 }
180
181 /* --- @sha512_init@, @sha384_init@ --- *
182 *
183 * Arguments: @sha512_ctx *ctx@ = pointer to context block to initialize
184 *
185 * Returns: ---
186 *
187 * Use: Initializes a context block ready for hashing.
188 */
189
190 void sha512_init(sha512_ctx *ctx)
191 {
192 SET64(ctx->a, 0x6a09e667, 0xf3bcc908);
193 SET64(ctx->b, 0xbb67ae85, 0x84caa73b);
194 SET64(ctx->c, 0x3c6ef372, 0xfe94f82b);
195 SET64(ctx->d, 0xa54ff53a, 0x5f1d36f1);
196 SET64(ctx->e, 0x510e527f, 0xade682d1);
197 SET64(ctx->f, 0x9b05688c, 0x2b3e6c1f);
198 SET64(ctx->g, 0x1f83d9ab, 0xfb41bd6b);
199 SET64(ctx->h, 0x5be0cd19, 0x137e2179);
200 ctx->off = 0;
201 ctx->nh = ctx->nl = 0;
202 }
203
204 void sha384_init(sha512_ctx *ctx)
205 {
206 SET64(ctx->a, 0xcbbb9d5d, 0xc1059ed8);
207 SET64(ctx->b, 0x629a292a, 0x367cd507);
208 SET64(ctx->c, 0x9159015a, 0x3070dd17);
209 SET64(ctx->d, 0x152fecd8, 0xf70e5939);
210 SET64(ctx->e, 0x67332667, 0xffc00b31);
211 SET64(ctx->f, 0x8eb44a87, 0x68581511);
212 SET64(ctx->g, 0xdb0c2e0d, 0x64f98fa7);
213 SET64(ctx->h, 0x47b5481d, 0xbefa4fa4);
214 ctx->off = 0;
215 ctx->nh = ctx->nl = 0;
216 }
217
218 /* --- @sha512_set@, @sha384_set@ --- *
219 *
220 * Arguments: @sha512_ctx *ctx@ = pointer to context block
221 * @const void *buf@ = pointer to state buffer
222 * @unsigned long count@ = current count of bytes processed
223 *
224 * Returns: ---
225 *
226 * Use: Initializes a context block from a given state. This is
227 * useful in cases where the initial hash state is meant to be
228 * secret, e.g., for NMAC and HMAC support.
229 */
230
231 void sha512_set(sha512_ctx *ctx, const void *buf, unsigned long count)
232 {
233 const octet *p = buf;
234 LOAD64_(ctx->a, p + 0);
235 LOAD64_(ctx->b, p + 8);
236 LOAD64_(ctx->c, p + 16);
237 LOAD64_(ctx->d, p + 24);
238 LOAD64_(ctx->e, p + 32);
239 LOAD64_(ctx->f, p + 40);
240 LOAD64_(ctx->g, p + 48);
241 LOAD64_(ctx->h, p + 56);
242 ctx->off = 0;
243 ctx->nl = U32(count);
244 ctx->nh = U32(((count & ~MASK32) >> 16) >> 16);
245 }
246
247 /* --- @sha512_hash@, @sha384_hash@ --- *
248 *
249 * Arguments: @sha512_ctx *ctx@ = pointer to context block
250 * @const void *buf@ = buffer of data to hash
251 * @size_t sz@ = size of buffer to hash
252 *
253 * Returns: ---
254 *
255 * Use: Hashes a buffer of data. The buffer may be of any size and
256 * alignment.
257 */
258
259 void sha512_hash(sha512_ctx *ctx, const void *buf, size_t sz)
260 {
261 HASH_BUFFER(SHA512, sha512, ctx, buf, sz);
262 }
263
264 /* --- @sha512_done@, @sha384_done@ --- *
265 *
266 * Arguments: @sha512_ctx *ctx@ = pointer to context block
267 * @void *hash@ = pointer to output buffer
268 *
269 * Returns: ---
270 *
271 * Use: Returns the hash of the data read so far.
272 */
273
274 static void final(sha512_ctx *ctx)
275 {
276 HASH_PAD(SHA512, sha512, ctx, 0x80, 0, 16);
277 memset(ctx->buf + SHA512_BUFSZ - 16, 0, 8);
278 STORE32(ctx->buf + SHA512_BUFSZ - 8, (ctx->nl >> 29) | (ctx->nh << 3));
279 STORE32(ctx->buf + SHA512_BUFSZ - 4, ctx->nl << 3);
280 sha512_compress(ctx, ctx->buf);
281 }
282
283 void sha512_done(sha512_ctx *ctx, void *hash)
284 {
285 octet *p = hash;
286 final(ctx);
287 STORE64_(p + 0, ctx->a);
288 STORE64_(p + 8, ctx->b);
289 STORE64_(p + 16, ctx->c);
290 STORE64_(p + 24, ctx->d);
291 STORE64_(p + 32, ctx->e);
292 STORE64_(p + 40, ctx->f);
293 STORE64_(p + 48, ctx->g);
294 STORE64_(p + 56, ctx->h);
295 }
296
297 void sha384_done(sha384_ctx *ctx, void *hash)
298 {
299 octet *p = hash;
300 final(ctx);
301 STORE64_(p + 0, ctx->a);
302 STORE64_(p + 8, ctx->b);
303 STORE64_(p + 16, ctx->c);
304 STORE64_(p + 24, ctx->d);
305 STORE64_(p + 32, ctx->e);
306 STORE64_(p + 40, ctx->f);
307 }
308
309 /* --- @sha512_state@, @sha384_state@ --- *
310 *
311 * Arguments: @sha512_ctx *ctx@ = pointer to context
312 * @void *state@ = pointer to buffer for current state
313 *
314 * Returns: Number of bytes written to the hash function so far.
315 *
316 * Use: Returns the current state of the hash function such that
317 * it can be passed to @sha512_set@.
318 */
319
320 unsigned long sha512_state(sha512_ctx *ctx, void *state)
321 {
322 octet *p = state;
323 STORE64_(p + 0, ctx->a);
324 STORE64_(p + 8, ctx->b);
325 STORE64_(p + 16, ctx->c);
326 STORE64_(p + 24, ctx->d);
327 STORE64_(p + 32, ctx->e);
328 STORE64_(p + 40, ctx->f);
329 STORE64_(p + 48, ctx->g);
330 STORE64_(p + 56, ctx->h);
331 return (ctx->nl | ((ctx->nh << 16) << 16));
332 }
333
334 /* --- Generic interface --- */
335
336 GHASH_DEF(SHA512, sha512)
337
338 /* --- Test code --- */
339
340 HASH_TEST(SHA512, sha512)
341
342 /*----- That's all, folks -------------------------------------------------*/
Catacomb cryptographic library (downstream of http://git.distorted.org.uk/~mdw/catacomb/)