[270] | 1 | /*
|
---|
| 2 | * sha1.c
|
---|
| 3 | *
|
---|
| 4 | * Originally witten by Steve Reid <steve@edmweb.com>
|
---|
| 5 | *
|
---|
| 6 | * Modified by Aaron D. Gifford <agifford@infowest.com>
|
---|
| 7 | *
|
---|
| 8 | * NO COPYRIGHT - THIS IS 100% IN THE PUBLIC DOMAIN
|
---|
| 9 | *
|
---|
| 10 | * The original unmodified version is available at:
|
---|
| 11 | * ftp://ftp.funet.fi/pub/crypt/hash/sha/sha1.c
|
---|
| 12 | *
|
---|
| 13 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTORS ``AS IS'' AND
|
---|
| 14 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
---|
| 15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
---|
| 16 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTORS BE LIABLE
|
---|
| 17 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
---|
| 18 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
---|
| 19 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
---|
| 20 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
---|
| 21 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
---|
| 22 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
---|
| 23 | * SUCH DAMAGE.
|
---|
| 24 | */
|
---|
| 25 |
|
---|
| 26 | #include <string.h>
|
---|
| 27 |
|
---|
| 28 | #include "sha1.h"
|
---|
| 29 |
|
---|
| 30 | #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
|
---|
| 31 |
|
---|
| 32 | /* blk0() and blk() perform the initial expand. */
|
---|
| 33 | /* I got the idea of expanding during the round function from SSLeay */
|
---|
| 34 |
|
---|
| 35 | #ifdef LITTLE_ENDIAN
|
---|
| 36 | #define blk0(i) (block->l[i] = (rol(block->l[i],24)&(sha1_quadbyte)0xFF00FF00) \
|
---|
| 37 | |(rol(block->l[i],8)&(sha1_quadbyte)0x00FF00FF))
|
---|
| 38 | #else
|
---|
| 39 | #define blk0(i) block->l[i]
|
---|
| 40 | #endif
|
---|
| 41 |
|
---|
| 42 | #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
|
---|
| 43 | ^block->l[(i+2)&15]^block->l[i&15],1))
|
---|
| 44 |
|
---|
| 45 | /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
|
---|
| 46 | #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
|
---|
| 47 | #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
|
---|
| 48 | #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
|
---|
| 49 | #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
|
---|
| 50 | #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
|
---|
| 51 |
|
---|
| 52 | typedef union _BYTE64QUAD16 {
|
---|
| 53 | sha1_byte c[64];
|
---|
| 54 | sha1_quadbyte l[16];
|
---|
| 55 | } BYTE64QUAD16;
|
---|
| 56 |
|
---|
| 57 | /* Hash a single 512-bit block. This is the core of the algorithm. */
|
---|
| 58 | void SHA1_Transform(sha1_quadbyte state[5], sha1_byte buffer[64]) {
|
---|
| 59 | sha1_quadbyte a, b, c, d, e;
|
---|
| 60 | BYTE64QUAD16 src;
|
---|
| 61 | BYTE64QUAD16 *block;
|
---|
| 62 |
|
---|
| 63 | /* slow but cast-align */
|
---|
| 64 | memcpy(src.c, buffer, sizeof(sha1_byte) * 64);
|
---|
| 65 | block = &src;
|
---|
| 66 | /* Copy context->state[] to working vars */
|
---|
| 67 | a = state[0];
|
---|
| 68 | b = state[1];
|
---|
| 69 | c = state[2];
|
---|
| 70 | d = state[3];
|
---|
| 71 | e = state[4];
|
---|
| 72 | /* 4 rounds of 20 operations each. Loop unrolled. */
|
---|
| 73 | 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);
|
---|
| 74 | 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);
|
---|
| 75 | 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);
|
---|
| 76 | 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);
|
---|
| 77 | 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);
|
---|
| 78 | 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);
|
---|
| 79 | 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);
|
---|
| 80 | 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);
|
---|
| 81 | 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);
|
---|
| 82 | 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);
|
---|
| 83 | 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);
|
---|
| 84 | 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);
|
---|
| 85 | 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);
|
---|
| 86 | 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);
|
---|
| 87 | 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);
|
---|
| 88 | 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);
|
---|
| 89 | 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);
|
---|
| 90 | 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);
|
---|
| 91 | 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);
|
---|
| 92 | 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);
|
---|
| 93 | /* Add the working vars back into context.state[] */
|
---|
| 94 | state[0] += a;
|
---|
| 95 | state[1] += b;
|
---|
| 96 | state[2] += c;
|
---|
| 97 | state[3] += d;
|
---|
| 98 | state[4] += e;
|
---|
| 99 | /* Wipe variables */
|
---|
| 100 | a = b = c = d = e = 0;
|
---|
| 101 | }
|
---|
| 102 |
|
---|
| 103 |
|
---|
| 104 | /* SHA1_Init - Initialize new context */
|
---|
| 105 | void SHA1_Init(SHA_CTX* context) {
|
---|
| 106 | /* SHA1 initialization constants */
|
---|
| 107 | context->state[0] = 0x67452301;
|
---|
| 108 | context->state[1] = 0xEFCDAB89;
|
---|
| 109 | context->state[2] = 0x98BADCFE;
|
---|
| 110 | context->state[3] = 0x10325476;
|
---|
| 111 | context->state[4] = 0xC3D2E1F0;
|
---|
| 112 | context->count[0] = context->count[1] = 0;
|
---|
| 113 | }
|
---|
| 114 |
|
---|
| 115 | /* Run your data through this. */
|
---|
| 116 | void SHA1_Update(SHA_CTX *context, sha1_byte *data, unsigned int len) {
|
---|
| 117 | unsigned int i, j;
|
---|
| 118 |
|
---|
| 119 | j = (context->count[0] >> 3) & 63;
|
---|
| 120 | if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
|
---|
| 121 | context->count[1] += (len >> 29);
|
---|
| 122 | if ((j + len) > 63) {
|
---|
| 123 | memcpy(&context->buffer[j], data, (i = 64-j));
|
---|
| 124 | SHA1_Transform(context->state, context->buffer);
|
---|
| 125 | for ( ; i + 63 < len; i += 64) {
|
---|
| 126 | SHA1_Transform(context->state, &data[i]);
|
---|
| 127 | }
|
---|
| 128 | j = 0;
|
---|
| 129 | }
|
---|
| 130 | else i = 0;
|
---|
| 131 | memcpy(&context->buffer[j], &data[i], len - i);
|
---|
| 132 | }
|
---|
| 133 |
|
---|
| 134 |
|
---|
| 135 | /* Add padding and return the message digest. */
|
---|
| 136 | void SHA1_Final(sha1_byte digest[SHA1_DIGEST_LENGTH], SHA_CTX *context) {
|
---|
| 137 | sha1_quadbyte i, j;
|
---|
| 138 | sha1_byte finalcount[8];
|
---|
| 139 |
|
---|
| 140 | for (i = 0; i < 8; i++) {
|
---|
| 141 | finalcount[i] = (sha1_byte)((context->count[(i >= 4 ? 0 : 1)]
|
---|
| 142 | >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
|
---|
| 143 | }
|
---|
| 144 | SHA1_Update(context, (sha1_byte *)"\200", 1);
|
---|
| 145 | while ((context->count[0] & 504) != 448) {
|
---|
| 146 | SHA1_Update(context, (sha1_byte *)"\0", 1);
|
---|
| 147 | }
|
---|
| 148 | /* Should cause a SHA1_Transform() */
|
---|
| 149 | SHA1_Update(context, finalcount, 8);
|
---|
| 150 | for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
|
---|
| 151 | digest[i] = (sha1_byte)
|
---|
| 152 | ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
|
---|
| 153 | }
|
---|
| 154 | /* Wipe variables */
|
---|
| 155 | i = j = 0;
|
---|
| 156 | memset(context->buffer, 0, SHA1_BLOCK_LENGTH);
|
---|
| 157 | memset(context->state, 0, SHA1_DIGEST_LENGTH);
|
---|
| 158 | memset(context->count, 0, 8);
|
---|
| 159 | memset(&finalcount, 0, 8);
|
---|
| 160 | }
|
---|