Linux kernel & device driver programming

Cross-Referenced Linux and Device Driver Code

[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ]
Version: [ 2.6.11.8 ] [ 2.6.25 ] [ 2.6.25.8 ] [ 2.6.31.13 ] Architecture: [ i386 ]
  1 /* SHA-512 code by Jean-Luc Cooke <jlcooke@certainkey.com>
  2  *
  3  * Copyright (c) Jean-Luc Cooke <jlcooke@certainkey.com>
  4  * Copyright (c) Andrew McDonald <andrew@mcdonald.org.uk>
  5  * Copyright (c) 2003 Kyle McMartin <kyle@debian.org>
  6  *
  7  * This program is free software; you can redistribute it and/or modify it
  8  * under the terms of the GNU General Public License as published by the
  9  * Free Software Foundation; either version 2, or (at your option) any
 10  * later version.
 11  *
 12  */
 13 
 14 #include <linux/kernel.h>
 15 #include <linux/module.h>
 16 
 17 #include <linux/mm.h>
 18 #include <linux/init.h>
 19 #include <linux/crypto.h>
 20 
 21 #include <asm/scatterlist.h>
 22 #include <asm/byteorder.h>
 23 
 24 #define SHA384_DIGEST_SIZE 48
 25 #define SHA512_DIGEST_SIZE 64
 26 #define SHA384_HMAC_BLOCK_SIZE  96
 27 #define SHA512_HMAC_BLOCK_SIZE 128
 28 
 29 struct sha512_ctx {
 30         u64 state[8];
 31         u32 count[4];
 32         u8 buf[128];
 33         u64 W[80];
 34 };
 35 
 36 static inline u64 Ch(u64 x, u64 y, u64 z)
 37 {
 38         return z ^ (x & (y ^ z));
 39 }
 40 
 41 static inline u64 Maj(u64 x, u64 y, u64 z)
 42 {
 43         return (x & y) | (z & (x | y));
 44 }
 45 
 46 static inline u64 RORu64(u64 x, u64 y)
 47 {
 48         return (x >> y) | (x << (64 - y));
 49 }
 50 
 51 static const u64 sha512_K[80] = {
 52         0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL,
 53         0xe9b5dba58189dbbcULL, 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
 54         0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL, 0xd807aa98a3030242ULL,
 55         0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
 56         0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL,
 57         0xc19bf174cf692694ULL, 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
 58         0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL, 0x2de92c6f592b0275ULL,
 59         0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
 60         0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL,
 61         0xbf597fc7beef0ee4ULL, 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
 62         0x06ca6351e003826fULL, 0x142929670a0e6e70ULL, 0x27b70a8546d22ffcULL,
 63         0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
 64         0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL,
 65         0x92722c851482353bULL, 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
 66         0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL, 0xd192e819d6ef5218ULL,
 67         0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
 68         0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL,
 69         0x34b0bcb5e19b48a8ULL, 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
 70         0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL, 0x748f82ee5defb2fcULL,
 71         0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
 72         0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL,
 73         0xc67178f2e372532bULL, 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
 74         0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL, 0x06f067aa72176fbaULL,
 75         0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
 76         0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL,
 77         0x431d67c49c100d4cULL, 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
 78         0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL,
 79 };
 80 
 81 #define e0(x)       (RORu64(x,28) ^ RORu64(x,34) ^ RORu64(x,39))
 82 #define e1(x)       (RORu64(x,14) ^ RORu64(x,18) ^ RORu64(x,41))
 83 #define s0(x)       (RORu64(x, 1) ^ RORu64(x, 8) ^ (x >> 7))
 84 #define s1(x)       (RORu64(x,19) ^ RORu64(x,61) ^ (x >> 6))
 85 
 86 /* H* initial state for SHA-512 */
 87 #define H0         0x6a09e667f3bcc908ULL
 88 #define H1         0xbb67ae8584caa73bULL
 89 #define H2         0x3c6ef372fe94f82bULL
 90 #define H3         0xa54ff53a5f1d36f1ULL
 91 #define H4         0x510e527fade682d1ULL
 92 #define H5         0x9b05688c2b3e6c1fULL
 93 #define H6         0x1f83d9abfb41bd6bULL
 94 #define H7         0x5be0cd19137e2179ULL
 95 
 96 /* H'* initial state for SHA-384 */
 97 #define HP0 0xcbbb9d5dc1059ed8ULL
 98 #define HP1 0x629a292a367cd507ULL
 99 #define HP2 0x9159015a3070dd17ULL
100 #define HP3 0x152fecd8f70e5939ULL
101 #define HP4 0x67332667ffc00b31ULL
102 #define HP5 0x8eb44a8768581511ULL
103 #define HP6 0xdb0c2e0d64f98fa7ULL
104 #define HP7 0x47b5481dbefa4fa4ULL
105 
106 static inline void LOAD_OP(int I, u64 *W, const u8 *input)
107 {
108         W[I] = __be64_to_cpu( ((u64*)(input))[I] );
109 }
110 
111 static inline void BLEND_OP(int I, u64 *W)
112 {
113         W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16];
114 }
115 
116 static void
117 sha512_transform(u64 *state, u64 *W, const u8 *input)
118 {
119         u64 a, b, c, d, e, f, g, h, t1, t2;
120 
121         int i;
122 
123         /* load the input */
124         for (i = 0; i < 16; i++)
125                 LOAD_OP(i, W, input);
126 
127         for (i = 16; i < 80; i++) {
128                 BLEND_OP(i, W);
129         }
130 
131         /* load the state into our registers */
132         a=state[0];   b=state[1];   c=state[2];   d=state[3];  
133         e=state[4];   f=state[5];   g=state[6];   h=state[7];  
134   
135         /* now iterate */
136         for (i=0; i<80; i+=8) {
137                 t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i  ] + W[i  ];
138                 t2 = e0(a) + Maj(a,b,c);    d+=t1;    h=t1+t2;
139                 t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[i+1];
140                 t2 = e0(h) + Maj(h,a,b);    c+=t1;    g=t1+t2;
141                 t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[i+2];
142                 t2 = e0(g) + Maj(g,h,a);    b+=t1;    f=t1+t2;
143                 t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[i+3];
144                 t2 = e0(f) + Maj(f,g,h);    a+=t1;    e=t1+t2;
145                 t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[i+4];
146                 t2 = e0(e) + Maj(e,f,g);    h+=t1;    d=t1+t2;
147                 t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[i+5];
148                 t2 = e0(d) + Maj(d,e,f);    g+=t1;    c=t1+t2;
149                 t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[i+6];
150                 t2 = e0(c) + Maj(c,d,e);    f+=t1;    b=t1+t2;
151                 t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[i+7];
152                 t2 = e0(b) + Maj(b,c,d);    e+=t1;    a=t1+t2;
153         }
154   
155         state[0] += a; state[1] += b; state[2] += c; state[3] += d;  
156         state[4] += e; state[5] += f; state[6] += g; state[7] += h;  
157 
158         /* erase our data */
159         a = b = c = d = e = f = g = h = t1 = t2 = 0;
160 }
161 
162 static void
163 sha512_init(void *ctx)
164 {
165         struct sha512_ctx *sctx = ctx;
166         sctx->state[0] = H0;
167         sctx->state[1] = H1;
168         sctx->state[2] = H2;
169         sctx->state[3] = H3;
170         sctx->state[4] = H4;
171         sctx->state[5] = H5;
172         sctx->state[6] = H6;
173         sctx->state[7] = H7;
174         sctx->count[0] = sctx->count[1] = sctx->count[2] = sctx->count[3] = 0;
175         memset(sctx->buf, 0, sizeof(sctx->buf));
176 }
177 
178 static void
179 sha384_init(void *ctx)
180 {
181         struct sha512_ctx *sctx = ctx;
182         sctx->state[0] = HP0;
183         sctx->state[1] = HP1;
184         sctx->state[2] = HP2;
185         sctx->state[3] = HP3;
186         sctx->state[4] = HP4;
187         sctx->state[5] = HP5;
188         sctx->state[6] = HP6;
189         sctx->state[7] = HP7;
190         sctx->count[0] = sctx->count[1] = sctx->count[2] = sctx->count[3] = 0;
191         memset(sctx->buf, 0, sizeof(sctx->buf));
192 }
193 
194 static void
195 sha512_update(void *ctx, const u8 *data, unsigned int len)
196 {
197         struct sha512_ctx *sctx = ctx;
198 
199         unsigned int i, index, part_len;
200 
201         /* Compute number of bytes mod 128 */
202         index = (unsigned int)((sctx->count[0] >> 3) & 0x7F);
203         
204         /* Update number of bits */
205         if ((sctx->count[0] += (len << 3)) < (len << 3)) {
206                 if ((sctx->count[1] += 1) < 1)
207                         if ((sctx->count[2] += 1) < 1)
208                                 sctx->count[3]++;
209                 sctx->count[1] += (len >> 29);
210         }
211         
212         part_len = 128 - index;
213         
214         /* Transform as many times as possible. */
215         if (len >= part_len) {
216                 memcpy(&sctx->buf[index], data, part_len);
217                 sha512_transform(sctx->state, sctx->W, sctx->buf);
218 
219                 for (i = part_len; i + 127 < len; i+=128)
220                         sha512_transform(sctx->state, sctx->W, &data[i]);
221 
222                 index = 0;
223         } else {
224                 i = 0;
225         }
226 
227         /* Buffer remaining input */
228         memcpy(&sctx->buf[index], &data[i], len - i);
229 
230         /* erase our data */
231         memset(sctx->W, 0, sizeof(sctx->W));
232 }
233 
234 static void
235 sha512_final(void *ctx, u8 *hash)
236 {
237         struct sha512_ctx *sctx = ctx;
238         
239         static u8 padding[128] = { 0x80, };
240 
241         u32 t;
242         u64 t2;
243         u8 bits[128];
244         unsigned int index, pad_len;
245         int i, j;
246 
247         index = pad_len = t = i = j = 0;
248         t2 = 0;
249 
250         /* Save number of bits */
251         t = sctx->count[0];
252         bits[15] = t; t>>=8;
253         bits[14] = t; t>>=8;
254         bits[13] = t; t>>=8;
255         bits[12] = t; 
256         t = sctx->count[1];
257         bits[11] = t; t>>=8;
258         bits[10] = t; t>>=8;
259         bits[9 ] = t; t>>=8;
260         bits[8 ] = t; 
261         t = sctx->count[2];
262         bits[7 ] = t; t>>=8;
263         bits[6 ] = t; t>>=8;
264         bits[5 ] = t; t>>=8;
265         bits[4 ] = t; 
266         t = sctx->count[3];
267         bits[3 ] = t; t>>=8;
268         bits[2 ] = t; t>>=8;
269         bits[1 ] = t; t>>=8;
270         bits[0 ] = t; 
271 
272         /* Pad out to 112 mod 128. */
273         index = (sctx->count[0] >> 3) & 0x7f;
274         pad_len = (index < 112) ? (112 - index) : ((128+112) - index);
275         sha512_update(sctx, padding, pad_len);
276 
277         /* Append length (before padding) */
278         sha512_update(sctx, bits, 16);
279 
280         /* Store state in digest */
281         for (i = j = 0; i < 8; i++, j += 8) {
282                 t2 = sctx->state[i];
283                 hash[j+7] = (char)t2 & 0xff; t2>>=8;
284                 hash[j+6] = (char)t2 & 0xff; t2>>=8;
285                 hash[j+5] = (char)t2 & 0xff; t2>>=8;
286                 hash[j+4] = (char)t2 & 0xff; t2>>=8;
287                 hash[j+3] = (char)t2 & 0xff; t2>>=8;
288                 hash[j+2] = (char)t2 & 0xff; t2>>=8;
289                 hash[j+1] = (char)t2 & 0xff; t2>>=8;
290                 hash[j  ] = (char)t2 & 0xff;
291         }
292         
293         /* Zeroize sensitive information. */
294         memset(sctx, 0, sizeof(struct sha512_ctx));
295 }
296 
297 static void sha384_final(void *ctx, u8 *hash)
298 {
299         struct sha512_ctx *sctx = ctx;
300         u8 D[64];
301 
302         sha512_final(sctx, D);
303 
304         memcpy(hash, D, 48);
305         memset(D, 0, 64);
306 }
307 
308 static struct crypto_alg sha512 = {
309         .cra_name       = "sha512",
310         .cra_flags      = CRYPTO_ALG_TYPE_DIGEST,
311         .cra_blocksize  = SHA512_HMAC_BLOCK_SIZE,
312         .cra_ctxsize    = sizeof(struct sha512_ctx),
313         .cra_module     = THIS_MODULE,
314         .cra_list       = LIST_HEAD_INIT(sha512.cra_list),
315         .cra_u          = { .digest = {
316                                 .dia_digestsize = SHA512_DIGEST_SIZE,
317                                 .dia_init       = sha512_init,
318                                 .dia_update     = sha512_update,
319                                 .dia_final      = sha512_final }
320         }
321 };
322 
323 static struct crypto_alg sha384 = {
324         .cra_name       = "sha384",
325         .cra_flags      = CRYPTO_ALG_TYPE_DIGEST,
326         .cra_blocksize  = SHA384_HMAC_BLOCK_SIZE,
327         .cra_ctxsize    = sizeof(struct sha512_ctx),
328         .cra_module     = THIS_MODULE,
329         .cra_list       = LIST_HEAD_INIT(sha384.cra_list),
330         .cra_u          = { .digest = {
331                                 .dia_digestsize = SHA384_DIGEST_SIZE,
332                                 .dia_init       = sha384_init,
333                                 .dia_update     = sha512_update,
334                                 .dia_final      = sha384_final }
335         }
336 };
337 
338 MODULE_ALIAS("sha384");
339 
340 static int __init init(void)
341 {
342         int ret = 0;
343 
344         if ((ret = crypto_register_alg(&sha384)) < 0)
345                 goto out;
346         if ((ret = crypto_register_alg(&sha512)) < 0)
347                 crypto_unregister_alg(&sha384);
348 out:
349         return ret;
350 }
351 
352 static void __exit fini(void)
353 {
354         crypto_unregister_alg(&sha384);
355         crypto_unregister_alg(&sha512);
356 }
357 
358 module_init(init);
359 module_exit(fini);
360 
361 MODULE_LICENSE("GPL");
362 MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");
363 
  This page was automatically generated by the LXR engine.