2 * RCSID $Id: ipsec_sha1.c,v 1.5 1999/12/13 13:59:13 rgb Exp $
6 * The rest of the code is derived from sha1.c by Steve Reid, which is
8 * Minor cosmetic changes to accomodate it in the Linux kernel by ji.
11 #include <asm/byteorder.h>
12 #include <linux/string.h>
14 #include "ipsec_sha1.h"
22 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
24 /* blk0() and blk() perform the initial expand. */
25 /* I got the idea of expanding during the round function from SSLeay */
26 #ifdef __LITTLE_ENDIAN
27 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
28 |(rol(block->l[i],8)&0x00FF00FF))
30 #define blk0(i) block->l[i]
32 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
33 ^block->l[(i+2)&15]^block->l[i&15],1))
35 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
36 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
37 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
38 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
39 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
40 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
43 /* Hash a single 512-bit block. This is the core of the algorithm. */
45 void SHA1Transform(__u32 state[5], __u8 buffer[64])
54 static unsigned char workspace[64];
55 block = (CHAR64LONG16*)workspace;
56 memcpy(block, buffer, 64);
58 block = (CHAR64LONG16*)buffer;
60 /* Copy context->state[] to working vars */
66 /* 4 rounds of 20 operations each. Loop unrolled. */
67 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);
68 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);
69 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);
70 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);
71 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);
72 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);
73 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);
74 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);
75 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);
76 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);
77 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);
78 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);
79 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);
80 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);
81 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);
82 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);
83 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);
84 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);
85 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);
86 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);
87 /* Add the working vars back into context.state[] */
94 a = b = c = d = e = 0;
98 /* SHA1Init - Initialize new context */
100 void SHA1Init(SHA1_CTX* context)
102 /* SHA1 initialization constants */
103 context->state[0] = 0x67452301;
104 context->state[1] = 0xEFCDAB89;
105 context->state[2] = 0x98BADCFE;
106 context->state[3] = 0x10325476;
107 context->state[4] = 0xC3D2E1F0;
108 context->count[0] = context->count[1] = 0;
112 /* Run your data through this. */
114 void SHA1Update(SHA1_CTX* context, unsigned char* data, __u32 len)
118 j = context->count[0];
119 if ((context->count[0] += len << 3) < j)
121 context->count[1] += (len>>29);
123 if ((j + len) > 63) {
124 memcpy(&context->buffer[j], data, (i = 64-j));
125 SHA1Transform(context->state, context->buffer);
126 for ( ; i + 63 < len; i += 64) {
127 SHA1Transform(context->state, &data[i]);
132 memcpy(&context->buffer[j], &data[i], len - i);
136 /* Add padding and return the message digest. */
138 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
141 unsigned char finalcount[8];
143 for (i = 0; i < 8; i++) {
144 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
145 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
147 SHA1Update(context, (unsigned char *)"\200", 1);
148 while ((context->count[0] & 504) != 448) {
149 SHA1Update(context, (unsigned char *)"\0", 1);
151 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
152 for (i = 0; i < 20; i++) {
153 digest[i] = (unsigned char)
154 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
158 memset(context->buffer, 0, 64);
159 memset(context->state, 0, 20);
160 memset(context->count, 0, 8);
161 memset(&finalcount, 0, 8);
162 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite its own static vars */
163 SHA1Transform(context->state, context->buffer);
169 * $Log: ipsec_sha1.c,v $
170 * Revision 1.5 1999/12/13 13:59:13 rgb
171 * Quick fix to argument size to Update bugs.
173 * Revision 1.4 1999/04/11 00:29:00 henry
176 * Revision 1.3 1999/04/06 04:54:27 rgb
177 * Fix/Add RCSID Id: and Log: bits to make PHMDs happy. This includes
180 * Revision 1.2 1999/01/22 06:55:50 rgb
183 * Revision 1.1 1998/06/18 21:27:50 henry
184 * move sources from klips/src to klips/net/ipsec, to keep stupid
185 * kernel-build scripts happier in the presence of symlinks
187 * Revision 1.2 1998/04/23 20:54:04 rgb
188 * Fixed md5 and sha1 include file nesting issues, to be cleaned up when
191 * Revision 1.1 1998/04/09 03:06:11 henry
192 * sources moved up from linux/net/ipsec
194 * Revision 1.1.1.1 1998/04/08 05:35:05 henry
195 * RGB's ipsec-0.8pre2.tar.gz ipsec-0.8
197 * Revision 0.4 1997/01/15 01:28:15 ji