Lines Matching refs:sha1
14 @file sha1.c
15 SHA1 code by Tom St Denis
19 #ifdef SHA1
23 "sha1",
61 a = md->sha1.state[0];
62 b = md->sha1.state[1];
63 c = md->sha1.state[2];
64 d = md->sha1.state[3];
65 e = md->sha1.state[4];
141 md->sha1.state[0] = md->sha1.state[0] + a;
142 md->sha1.state[1] = md->sha1.state[1] + b;
143 md->sha1.state[2] = md->sha1.state[2] + c;
144 md->sha1.state[3] = md->sha1.state[3] + d;
145 md->sha1.state[4] = md->sha1.state[4] + e;
168 md->sha1.state[0] = 0x67452301UL;
169 md->sha1.state[1] = 0xefcdab89UL;
170 md->sha1.state[2] = 0x98badcfeUL;
171 md->sha1.state[3] = 0x10325476UL;
172 md->sha1.state[4] = 0xc3d2e1f0UL;
173 md->sha1.curlen = 0;
174 md->sha1.length = 0;
185 HASH_PROCESS(sha1_process, sha1_compress, sha1, 64)
200 if (md->sha1.curlen >= sizeof(md->sha1.buf)) {
205 md->sha1.length += md->sha1.curlen * 8;
208 md->sha1.buf[md->sha1.curlen++] = (unsigned char)0x80;
214 if (md->sha1.curlen > 56) {
215 while (md->sha1.curlen < 64) {
216 md->sha1.buf[md->sha1.curlen++] = (unsigned char)0;
218 sha1_compress(md, md->sha1.buf);
219 md->sha1.curlen = 0;
223 while (md->sha1.curlen < 56) {
224 md->sha1.buf[md->sha1.curlen++] = (unsigned char)0;
228 STORE64H(md->sha1.length, md->sha1.buf+56);
229 sha1_compress(md, md->sha1.buf);
233 STORE32H(md->sha1.state[i], out+(4*i));
286 /* $Source: /cvs/libtom/libtomcrypt/src/hashes/sha1.c,v $ */
