1de4a1d01951937632098a6cda45859afa587a06fsewardj 2de4a1d01951937632098a6cda45859afa587a06fsewardj/* 3de4a1d01951937632098a6cda45859afa587a06fsewardjStick the enclosed text in a file "sha1.test.c". 4de4a1d01951937632098a6cda45859afa587a06fsewardj 5de4a1d01951937632098a6cda45859afa587a06fsewardjHere is a sample run: 6de4a1d01951937632098a6cda45859afa587a06fsewardj hugh $ cc sha1.test.c 7de4a1d01951937632098a6cda45859afa587a06fsewardj hugh $ valgrind ./a.out 8de4a1d01951937632098a6cda45859afa587a06fsewardj ==26189== valgrind-20020227, a memory error detector for x86 GNU/Linux. 90e1b514ab8e837f75a207a037ea53a6a721e9d28njn ==26189== Copyright (C) 2000-200x, and GNU GPL'd, by Julian Seward. 10de4a1d01951937632098a6cda45859afa587a06fsewardj ==26189== For more details, rerun with: -v 11de4a1d01951937632098a6cda45859afa587a06fsewardj ==26189== 12de4a1d01951937632098a6cda45859afa587a06fsewardj 13de4a1d01951937632098a6cda45859afa587a06fsewardj valgrind: vg_main.c:495 (vgPlain_create_translation_for): Assertion `trans_size > 0 && trans_size < 65536' failed. 14de4a1d01951937632098a6cda45859afa587a06fsewardj Please report this bug to me at: jseward@acm.org 15de4a1d01951937632098a6cda45859afa587a06fsewardj 16de4a1d01951937632098a6cda45859afa587a06fsewardj hugh $ valgrind --instrument=no ./a.out 17de4a1d01951937632098a6cda45859afa587a06fsewardj ==26209== valgrind-20020227, a memory error detector for x86 GNU/Linux. 180e1b514ab8e837f75a207a037ea53a6a721e9d28njn ==26209== Copyright (C) 2000-200x, and GNU GPL'd, by Julian Seward. 19de4a1d01951937632098a6cda45859afa587a06fsewardj ==26209== For more details, rerun with: -v 20de4a1d01951937632098a6cda45859afa587a06fsewardj ==26209== 21de4a1d01951937632098a6cda45859afa587a06fsewardj ==26209== 22de4a1d01951937632098a6cda45859afa587a06fsewardj 23de4a1d01951937632098a6cda45859afa587a06fsewardj*/ 24de4a1d01951937632098a6cda45859afa587a06fsewardj 25de4a1d01951937632098a6cda45859afa587a06fsewardj/* ================ sha1.c ================ */ 26de4a1d01951937632098a6cda45859afa587a06fsewardj/* 27de4a1d01951937632098a6cda45859afa587a06fsewardjSHA-1 in C 28de4a1d01951937632098a6cda45859afa587a06fsewardjBy Steve Reid <steve@edmweb.com> 29de4a1d01951937632098a6cda45859afa587a06fsewardj100% Public Domain 30de4a1d01951937632098a6cda45859afa587a06fsewardj 31de4a1d01951937632098a6cda45859afa587a06fsewardjTest Vectors (from FIPS PUB 180-1) 32de4a1d01951937632098a6cda45859afa587a06fsewardj"abc" 33de4a1d01951937632098a6cda45859afa587a06fsewardj A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 34de4a1d01951937632098a6cda45859afa587a06fsewardj"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" 35de4a1d01951937632098a6cda45859afa587a06fsewardj 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 36de4a1d01951937632098a6cda45859afa587a06fsewardjA million repetitions of "a" 37de4a1d01951937632098a6cda45859afa587a06fsewardj 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F 38de4a1d01951937632098a6cda45859afa587a06fsewardj*/ 39de4a1d01951937632098a6cda45859afa587a06fsewardj 40de4a1d01951937632098a6cda45859afa587a06fsewardj/* #define LITTLE_ENDIAN * This should be #define'd already, if true. */ 41de4a1d01951937632098a6cda45859afa587a06fsewardj/* #define SHA1HANDSOFF * Copies data before messing with it. */ 42de4a1d01951937632098a6cda45859afa587a06fsewardj 43de4a1d01951937632098a6cda45859afa587a06fsewardj#define SHA1HANDSOFF 44de4a1d01951937632098a6cda45859afa587a06fsewardj 45b3a8929e200dde791a8ce468e461d183051b5134mueller#include <config.h> 46b3a8929e200dde791a8ce468e461d183051b5134mueller 47de4a1d01951937632098a6cda45859afa587a06fsewardj#include <string.h> 48de4a1d01951937632098a6cda45859afa587a06fsewardj#include <sys/types.h> /* for u_int*_t */ 49de4a1d01951937632098a6cda45859afa587a06fsewardj 50de4a1d01951937632098a6cda45859afa587a06fsewardj/* ================ sha1.h ================ */ 51de4a1d01951937632098a6cda45859afa587a06fsewardj/* 52de4a1d01951937632098a6cda45859afa587a06fsewardjSHA-1 in C 53de4a1d01951937632098a6cda45859afa587a06fsewardjBy Steve Reid <steve@edmweb.com> 54de4a1d01951937632098a6cda45859afa587a06fsewardj100% Public Domain 55de4a1d01951937632098a6cda45859afa587a06fsewardj*/ 56de4a1d01951937632098a6cda45859afa587a06fsewardj 57de4a1d01951937632098a6cda45859afa587a06fsewardjtypedef struct { 58de4a1d01951937632098a6cda45859afa587a06fsewardj u_int32_t state[5]; 59de4a1d01951937632098a6cda45859afa587a06fsewardj u_int32_t count[2]; 60de4a1d01951937632098a6cda45859afa587a06fsewardj unsigned char buffer[64]; 61de4a1d01951937632098a6cda45859afa587a06fsewardj} SHA1_CTX; 62de4a1d01951937632098a6cda45859afa587a06fsewardj 63de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Transform(u_int32_t state[5], const unsigned char buffer[64]); 64de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Init(SHA1_CTX* context); 65de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len); 66de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Final(unsigned char digest[20], SHA1_CTX* context); 67de4a1d01951937632098a6cda45859afa587a06fsewardj/* ================ end of sha1.h ================ */ 68b3a8929e200dde791a8ce468e461d183051b5134mueller 69b3a8929e200dde791a8ce468e461d183051b5134mueller#ifdef HAVE_SYS_ENDIAN_H 70b3a8929e200dde791a8ce468e461d183051b5134mueller#include <sys/endian.h> 71b3a8929e200dde791a8ce468e461d183051b5134mueller#endif 72b3a8929e200dde791a8ce468e461d183051b5134mueller 73b3a8929e200dde791a8ce468e461d183051b5134mueller#ifdef HAVE_ENDIAN_H 74de4a1d01951937632098a6cda45859afa587a06fsewardj#include <endian.h> 75b3a8929e200dde791a8ce468e461d183051b5134mueller#endif 76de4a1d01951937632098a6cda45859afa587a06fsewardj 77de4a1d01951937632098a6cda45859afa587a06fsewardj#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 78de4a1d01951937632098a6cda45859afa587a06fsewardj 79de4a1d01951937632098a6cda45859afa587a06fsewardj/* blk0() and blk() perform the initial expand. */ 80de4a1d01951937632098a6cda45859afa587a06fsewardj/* I got the idea of expanding during the round function from SSLeay */ 81de4a1d01951937632098a6cda45859afa587a06fsewardj#if BYTE_ORDER == LITTLE_ENDIAN 82de4a1d01951937632098a6cda45859afa587a06fsewardj#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 83de4a1d01951937632098a6cda45859afa587a06fsewardj |(rol(block->l[i],8)&0x00FF00FF)) 84de4a1d01951937632098a6cda45859afa587a06fsewardj#elif BYTE_ORDER == BIG_ENDIAN 85de4a1d01951937632098a6cda45859afa587a06fsewardj#define blk0(i) block->l[i] 86de4a1d01951937632098a6cda45859afa587a06fsewardj#else 87de4a1d01951937632098a6cda45859afa587a06fsewardj#error "Endianness not defined!" 88de4a1d01951937632098a6cda45859afa587a06fsewardj#endif 89de4a1d01951937632098a6cda45859afa587a06fsewardj#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 90de4a1d01951937632098a6cda45859afa587a06fsewardj ^block->l[(i+2)&15]^block->l[i&15],1)) 91de4a1d01951937632098a6cda45859afa587a06fsewardj 92de4a1d01951937632098a6cda45859afa587a06fsewardj/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ 93de4a1d01951937632098a6cda45859afa587a06fsewardj#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); 94de4a1d01951937632098a6cda45859afa587a06fsewardj#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); 95de4a1d01951937632098a6cda45859afa587a06fsewardj#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); 96de4a1d01951937632098a6cda45859afa587a06fsewardj#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); 97de4a1d01951937632098a6cda45859afa587a06fsewardj#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); 98de4a1d01951937632098a6cda45859afa587a06fsewardj 99de4a1d01951937632098a6cda45859afa587a06fsewardj 100de4a1d01951937632098a6cda45859afa587a06fsewardj/* Hash a single 512-bit block. This is the core of the algorithm. */ 101de4a1d01951937632098a6cda45859afa587a06fsewardj 102de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Transform(u_int32_t state[5], const unsigned char buffer[64]) 103de4a1d01951937632098a6cda45859afa587a06fsewardj{ 104de4a1d01951937632098a6cda45859afa587a06fsewardju_int32_t a, b, c, d, e; 105de4a1d01951937632098a6cda45859afa587a06fsewardjtypedef union { 106de4a1d01951937632098a6cda45859afa587a06fsewardj unsigned char c[64]; 107de4a1d01951937632098a6cda45859afa587a06fsewardj u_int32_t l[16]; 108de4a1d01951937632098a6cda45859afa587a06fsewardj} CHAR64LONG16; 109de4a1d01951937632098a6cda45859afa587a06fsewardj#ifdef SHA1HANDSOFF 110de4a1d01951937632098a6cda45859afa587a06fsewardjCHAR64LONG16 block[1]; /* use array to appear as a pointer */ 111de4a1d01951937632098a6cda45859afa587a06fsewardj memcpy(block, buffer, 64); 112de4a1d01951937632098a6cda45859afa587a06fsewardj#else 113de4a1d01951937632098a6cda45859afa587a06fsewardj /* The following had better never be used because it causes the 114de4a1d01951937632098a6cda45859afa587a06fsewardj * pointer-to-const buffer to be cast into a pointer to non-const. 115de4a1d01951937632098a6cda45859afa587a06fsewardj * And the result is written through. I threw a "const" in, hoping 116de4a1d01951937632098a6cda45859afa587a06fsewardj * this will cause a diagnostic. 117de4a1d01951937632098a6cda45859afa587a06fsewardj */ 118de4a1d01951937632098a6cda45859afa587a06fsewardjCHAR64LONG16* block = (const CHAR64LONG16*)buffer; 119de4a1d01951937632098a6cda45859afa587a06fsewardj#endif 120de4a1d01951937632098a6cda45859afa587a06fsewardj /* Copy context->state[] to working vars */ 121de4a1d01951937632098a6cda45859afa587a06fsewardj a = state[0]; 122de4a1d01951937632098a6cda45859afa587a06fsewardj b = state[1]; 123de4a1d01951937632098a6cda45859afa587a06fsewardj c = state[2]; 124de4a1d01951937632098a6cda45859afa587a06fsewardj d = state[3]; 125de4a1d01951937632098a6cda45859afa587a06fsewardj e = state[4]; 126de4a1d01951937632098a6cda45859afa587a06fsewardj /* 4 rounds of 20 operations each. Loop unrolled. */ 127de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 128de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 129de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 130de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 131de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 132de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 133de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 134de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 135de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 136de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 137de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 138de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 139de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 140de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 141de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 142de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 143de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 144de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 145de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 146de4a1d01951937632098a6cda45859afa587a06fsewardj 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); 147de4a1d01951937632098a6cda45859afa587a06fsewardj /* Add the working vars back into context.state[] */ 148de4a1d01951937632098a6cda45859afa587a06fsewardj state[0] += a; 149de4a1d01951937632098a6cda45859afa587a06fsewardj state[1] += b; 150de4a1d01951937632098a6cda45859afa587a06fsewardj state[2] += c; 151de4a1d01951937632098a6cda45859afa587a06fsewardj state[3] += d; 152de4a1d01951937632098a6cda45859afa587a06fsewardj state[4] += e; 153de4a1d01951937632098a6cda45859afa587a06fsewardj /* Wipe variables */ 154de4a1d01951937632098a6cda45859afa587a06fsewardj a = b = c = d = e = 0; 155de4a1d01951937632098a6cda45859afa587a06fsewardj#ifdef SHA1HANDSOFF 156de4a1d01951937632098a6cda45859afa587a06fsewardj memset(block, '\0', sizeof(block)); 157de4a1d01951937632098a6cda45859afa587a06fsewardj#endif 158de4a1d01951937632098a6cda45859afa587a06fsewardj} 159de4a1d01951937632098a6cda45859afa587a06fsewardj 160de4a1d01951937632098a6cda45859afa587a06fsewardj 161de4a1d01951937632098a6cda45859afa587a06fsewardj/* SHA1Init - Initialize new context */ 162de4a1d01951937632098a6cda45859afa587a06fsewardj 163de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Init(SHA1_CTX* context) 164de4a1d01951937632098a6cda45859afa587a06fsewardj{ 165de4a1d01951937632098a6cda45859afa587a06fsewardj /* SHA1 initialization constants */ 166de4a1d01951937632098a6cda45859afa587a06fsewardj context->state[0] = 0x67452301; 167de4a1d01951937632098a6cda45859afa587a06fsewardj context->state[1] = 0xEFCDAB89; 168de4a1d01951937632098a6cda45859afa587a06fsewardj context->state[2] = 0x98BADCFE; 169de4a1d01951937632098a6cda45859afa587a06fsewardj context->state[3] = 0x10325476; 170de4a1d01951937632098a6cda45859afa587a06fsewardj context->state[4] = 0xC3D2E1F0; 171de4a1d01951937632098a6cda45859afa587a06fsewardj context->count[0] = context->count[1] = 0; 172de4a1d01951937632098a6cda45859afa587a06fsewardj} 173de4a1d01951937632098a6cda45859afa587a06fsewardj 174de4a1d01951937632098a6cda45859afa587a06fsewardj 175de4a1d01951937632098a6cda45859afa587a06fsewardj/* Run your data through this. */ 176de4a1d01951937632098a6cda45859afa587a06fsewardj 177de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len) 178de4a1d01951937632098a6cda45859afa587a06fsewardj{ 179de4a1d01951937632098a6cda45859afa587a06fsewardju_int32_t i; 180de4a1d01951937632098a6cda45859afa587a06fsewardju_int32_t j; 181de4a1d01951937632098a6cda45859afa587a06fsewardj 182de4a1d01951937632098a6cda45859afa587a06fsewardj j = context->count[0]; 183de4a1d01951937632098a6cda45859afa587a06fsewardj if ((context->count[0] += len << 3) < j) 184de4a1d01951937632098a6cda45859afa587a06fsewardj context->count[1]++; 185de4a1d01951937632098a6cda45859afa587a06fsewardj context->count[1] += (len>>29); 186de4a1d01951937632098a6cda45859afa587a06fsewardj j = (j >> 3) & 63; 187de4a1d01951937632098a6cda45859afa587a06fsewardj if ((j + len) > 63) { 188de4a1d01951937632098a6cda45859afa587a06fsewardj memcpy(&context->buffer[j], data, (i = 64-j)); 189de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1Transform(context->state, context->buffer); 190de4a1d01951937632098a6cda45859afa587a06fsewardj for ( ; i + 63 < len; i += 64) { 191de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1Transform(context->state, &data[i]); 192de4a1d01951937632098a6cda45859afa587a06fsewardj } 193de4a1d01951937632098a6cda45859afa587a06fsewardj j = 0; 194de4a1d01951937632098a6cda45859afa587a06fsewardj } 195de4a1d01951937632098a6cda45859afa587a06fsewardj else i = 0; 196de4a1d01951937632098a6cda45859afa587a06fsewardj memcpy(&context->buffer[j], &data[i], len - i); 197de4a1d01951937632098a6cda45859afa587a06fsewardj} 198de4a1d01951937632098a6cda45859afa587a06fsewardj 199de4a1d01951937632098a6cda45859afa587a06fsewardj 200de4a1d01951937632098a6cda45859afa587a06fsewardj/* Add padding and return the message digest. */ 201de4a1d01951937632098a6cda45859afa587a06fsewardj 202de4a1d01951937632098a6cda45859afa587a06fsewardjvoid SHA1Final(unsigned char digest[20], SHA1_CTX* context) 203de4a1d01951937632098a6cda45859afa587a06fsewardj{ 204de4a1d01951937632098a6cda45859afa587a06fsewardjunsigned i; 205de4a1d01951937632098a6cda45859afa587a06fsewardjunsigned char finalcount[8]; 206de4a1d01951937632098a6cda45859afa587a06fsewardjunsigned char c; 207de4a1d01951937632098a6cda45859afa587a06fsewardj 208de4a1d01951937632098a6cda45859afa587a06fsewardj#if 0 /* untested "improvement" by DHR */ 209de4a1d01951937632098a6cda45859afa587a06fsewardj /* Convert context->count to a sequence of bytes 210de4a1d01951937632098a6cda45859afa587a06fsewardj * in finalcount. Second element first, but 211de4a1d01951937632098a6cda45859afa587a06fsewardj * big-endian order within element. 212de4a1d01951937632098a6cda45859afa587a06fsewardj * But we do it all backwards. 213de4a1d01951937632098a6cda45859afa587a06fsewardj */ 214de4a1d01951937632098a6cda45859afa587a06fsewardj unsigned char *fcp = &finalcount[8]; 215de4a1d01951937632098a6cda45859afa587a06fsewardj 216de4a1d01951937632098a6cda45859afa587a06fsewardj for (i = 0; i < 2; i++) 217de4a1d01951937632098a6cda45859afa587a06fsewardj { 218de4a1d01951937632098a6cda45859afa587a06fsewardj u_int32_t t = context->count[i]; 219de4a1d01951937632098a6cda45859afa587a06fsewardj int j; 220de4a1d01951937632098a6cda45859afa587a06fsewardj 221de4a1d01951937632098a6cda45859afa587a06fsewardj for (j = 0; j < 4; t >>= 8, j++) 222de4a1d01951937632098a6cda45859afa587a06fsewardj *--fcp = (unsigned char) t 223de4a1d01951937632098a6cda45859afa587a06fsewardj } 224de4a1d01951937632098a6cda45859afa587a06fsewardj#else 225de4a1d01951937632098a6cda45859afa587a06fsewardj for (i = 0; i < 8; i++) { 226de4a1d01951937632098a6cda45859afa587a06fsewardj finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] 227de4a1d01951937632098a6cda45859afa587a06fsewardj >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ 228de4a1d01951937632098a6cda45859afa587a06fsewardj } 229de4a1d01951937632098a6cda45859afa587a06fsewardj#endif 230de4a1d01951937632098a6cda45859afa587a06fsewardj c = 0200; 231de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1Update(context, &c, 1); 232de4a1d01951937632098a6cda45859afa587a06fsewardj while ((context->count[0] & 504) != 448) { 233de4a1d01951937632098a6cda45859afa587a06fsewardj c = 0000; 234de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1Update(context, &c, 1); 235de4a1d01951937632098a6cda45859afa587a06fsewardj } 236de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ 237de4a1d01951937632098a6cda45859afa587a06fsewardj for (i = 0; i < 20; i++) { 238de4a1d01951937632098a6cda45859afa587a06fsewardj digest[i] = (unsigned char) 239de4a1d01951937632098a6cda45859afa587a06fsewardj ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); 240de4a1d01951937632098a6cda45859afa587a06fsewardj } 241de4a1d01951937632098a6cda45859afa587a06fsewardj /* Wipe variables */ 242de4a1d01951937632098a6cda45859afa587a06fsewardj memset(context, '\0', sizeof(*context)); 243de4a1d01951937632098a6cda45859afa587a06fsewardj memset(&finalcount, '\0', sizeof(finalcount)); 244de4a1d01951937632098a6cda45859afa587a06fsewardj} 245de4a1d01951937632098a6cda45859afa587a06fsewardj/* ================ end of sha1.c ================ */ 246de4a1d01951937632098a6cda45859afa587a06fsewardj 247de4a1d01951937632098a6cda45859afa587a06fsewardjint 248de4a1d01951937632098a6cda45859afa587a06fsewardjmain(int argc, char **argv) 249de4a1d01951937632098a6cda45859afa587a06fsewardj{ 250de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1_CTX ctx; 251de4a1d01951937632098a6cda45859afa587a06fsewardj unsigned char hash[20]; 252654b542166d7f2e8e89f1cd8430e7ed2ba96f230florian unsigned char abc[] = "abc"; 253de4a1d01951937632098a6cda45859afa587a06fsewardj 254de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1Init(&ctx); 255654b542166d7f2e8e89f1cd8430e7ed2ba96f230florian SHA1Update(&ctx, abc, 3); 256de4a1d01951937632098a6cda45859afa587a06fsewardj SHA1Final(hash, &ctx); 257de4a1d01951937632098a6cda45859afa587a06fsewardj return 0; 258de4a1d01951937632098a6cda45859afa587a06fsewardj} 259de4a1d01951937632098a6cda45859afa587a06fsewardj 260de4a1d01951937632098a6cda45859afa587a06fsewardj 261