yading@11: /* yading@11: * Copyright (C) 2007 Michael Niedermayer yading@11: * Copyright (C) 2009 Konstantin Shishkov yading@11: * based on public domain SHA-1 code by Steve Reid yading@11: * and on BSD-licensed SHA-2 code by Aaron D. Gifford yading@11: * yading@11: * This file is part of FFmpeg. yading@11: * yading@11: * FFmpeg is free software; you can redistribute it and/or yading@11: * modify it under the terms of the GNU Lesser General Public yading@11: * License as published by the Free Software Foundation; either yading@11: * version 2.1 of the License, or (at your option) any later version. yading@11: * yading@11: * FFmpeg is distributed in the hope that it will be useful, yading@11: * but WITHOUT ANY WARRANTY; without even the implied warranty of yading@11: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU yading@11: * Lesser General Public License for more details. yading@11: * yading@11: * You should have received a copy of the GNU Lesser General Public yading@11: * License along with FFmpeg; if not, write to the Free Software yading@11: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA yading@11: */ yading@11: yading@11: #include yading@11: #include "avutil.h" yading@11: #include "bswap.h" yading@11: #include "sha.h" yading@11: #include "intreadwrite.h" yading@11: #include "mem.h" yading@11: yading@11: /** hash context */ yading@11: typedef struct AVSHA { yading@11: uint8_t digest_len; ///< digest length in 32-bit words yading@11: uint64_t count; ///< number of bytes in buffer yading@11: uint8_t buffer[64]; ///< 512-bit buffer of input values used in hash updating yading@11: uint32_t state[8]; ///< current hash value yading@11: /** function used to update hash for 512-bit input block */ yading@11: void (*transform)(uint32_t *state, const uint8_t buffer[64]); yading@11: } AVSHA; yading@11: yading@11: const int av_sha_size = sizeof(AVSHA); yading@11: yading@11: struct AVSHA *av_sha_alloc(void) yading@11: { yading@11: return av_mallocz(sizeof(struct AVSHA)); yading@11: } yading@11: yading@11: #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) yading@11: yading@11: /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ yading@11: #define blk0(i) (block[i] = AV_RB32(buffer + 4 * (i))) yading@11: #define blk(i) (block[i] = rol(block[i-3] ^ block[i-8] ^ block[i-14] ^ block[i-16], 1)) yading@11: yading@11: #define R0(v,w,x,y,z,i) z += ((w&(x^y))^y) + blk0(i) + 0x5A827999 + rol(v, 5); w = rol(w, 30); yading@11: #define R1(v,w,x,y,z,i) z += ((w&(x^y))^y) + blk (i) + 0x5A827999 + rol(v, 5); w = rol(w, 30); yading@11: #define R2(v,w,x,y,z,i) z += ( w^x ^y) + blk (i) + 0x6ED9EBA1 + rol(v, 5); w = rol(w, 30); yading@11: #define R3(v,w,x,y,z,i) z += (((w|x)&y)|(w&x)) + blk (i) + 0x8F1BBCDC + rol(v, 5); w = rol(w, 30); yading@11: #define R4(v,w,x,y,z,i) z += ( w^x ^y) + blk (i) + 0xCA62C1D6 + rol(v, 5); w = rol(w, 30); yading@11: yading@11: /* Hash a single 512-bit block. This is the core of the algorithm. */ yading@11: yading@11: static void sha1_transform(uint32_t state[5], const uint8_t buffer[64]) yading@11: { yading@11: uint32_t block[80]; yading@11: unsigned int i, a, b, c, d, e; yading@11: yading@11: a = state[0]; yading@11: b = state[1]; yading@11: c = state[2]; yading@11: d = state[3]; yading@11: e = state[4]; yading@11: #if CONFIG_SMALL yading@11: for (i = 0; i < 80; i++) { yading@11: int t; yading@11: if (i < 16) yading@11: t = AV_RB32(buffer + 4 * i); yading@11: else yading@11: t = rol(block[i-3] ^ block[i-8] ^ block[i-14] ^ block[i-16], 1); yading@11: block[i] = t; yading@11: t += e + rol(a, 5); yading@11: if (i < 40) { yading@11: if (i < 20) yading@11: t += ((b&(c^d))^d) + 0x5A827999; yading@11: else yading@11: t += ( b^c ^d) + 0x6ED9EBA1; yading@11: } else { yading@11: if (i < 60) yading@11: t += (((b|c)&d)|(b&c)) + 0x8F1BBCDC; yading@11: else yading@11: t += ( b^c ^d) + 0xCA62C1D6; yading@11: } yading@11: e = d; yading@11: d = c; yading@11: c = rol(b, 30); yading@11: b = a; yading@11: a = t; yading@11: } yading@11: #else yading@11: for (i = 0; i < 15; i += 5) { yading@11: R0(a, b, c, d, e, 0 + i); yading@11: R0(e, a, b, c, d, 1 + i); yading@11: R0(d, e, a, b, c, 2 + i); yading@11: R0(c, d, e, a, b, 3 + i); yading@11: R0(b, c, d, e, a, 4 + i); yading@11: } yading@11: R0(a, b, c, d, e, 15); yading@11: R1(e, a, b, c, d, 16); yading@11: R1(d, e, a, b, c, 17); yading@11: R1(c, d, e, a, b, 18); yading@11: R1(b, c, d, e, a, 19); yading@11: for (i = 20; i < 40; i += 5) { yading@11: R2(a, b, c, d, e, 0 + i); yading@11: R2(e, a, b, c, d, 1 + i); yading@11: R2(d, e, a, b, c, 2 + i); yading@11: R2(c, d, e, a, b, 3 + i); yading@11: R2(b, c, d, e, a, 4 + i); yading@11: } yading@11: for (; i < 60; i += 5) { yading@11: R3(a, b, c, d, e, 0 + i); yading@11: R3(e, a, b, c, d, 1 + i); yading@11: R3(d, e, a, b, c, 2 + i); yading@11: R3(c, d, e, a, b, 3 + i); yading@11: R3(b, c, d, e, a, 4 + i); yading@11: } yading@11: for (; i < 80; i += 5) { yading@11: R4(a, b, c, d, e, 0 + i); yading@11: R4(e, a, b, c, d, 1 + i); yading@11: R4(d, e, a, b, c, 2 + i); yading@11: R4(c, d, e, a, b, 3 + i); yading@11: R4(b, c, d, e, a, 4 + i); yading@11: } yading@11: #endif yading@11: state[0] += a; yading@11: state[1] += b; yading@11: state[2] += c; yading@11: state[3] += d; yading@11: state[4] += e; yading@11: } yading@11: yading@11: static const uint32_t K256[64] = { yading@11: 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, yading@11: 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, yading@11: 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, yading@11: 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, yading@11: 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, yading@11: 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, yading@11: 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, yading@11: 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, yading@11: 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, yading@11: 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, yading@11: 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, yading@11: 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, yading@11: 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, yading@11: 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, yading@11: 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, yading@11: 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 yading@11: }; yading@11: yading@11: yading@11: #define Ch(x,y,z) (((x) & ((y) ^ (z))) ^ (z)) yading@11: #define Maj(x,y,z) ((((x) | (y)) & (z)) | ((x) & (y))) yading@11: yading@11: #define Sigma0_256(x) (rol((x), 30) ^ rol((x), 19) ^ rol((x), 10)) yading@11: #define Sigma1_256(x) (rol((x), 26) ^ rol((x), 21) ^ rol((x), 7)) yading@11: #define sigma0_256(x) (rol((x), 25) ^ rol((x), 14) ^ ((x) >> 3)) yading@11: #define sigma1_256(x) (rol((x), 15) ^ rol((x), 13) ^ ((x) >> 10)) yading@11: yading@11: #undef blk yading@11: #define blk(i) (block[i] = block[i - 16] + sigma0_256(block[i - 15]) + \ yading@11: sigma1_256(block[i - 2]) + block[i - 7]) yading@11: yading@11: #define ROUND256(a,b,c,d,e,f,g,h) \ yading@11: T1 += (h) + Sigma1_256(e) + Ch((e), (f), (g)) + K256[i]; \ yading@11: (d) += T1; \ yading@11: (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \ yading@11: i++ yading@11: yading@11: #define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \ yading@11: T1 = blk0(i); \ yading@11: ROUND256(a,b,c,d,e,f,g,h) yading@11: yading@11: #define ROUND256_16_TO_63(a,b,c,d,e,f,g,h) \ yading@11: T1 = blk(i); \ yading@11: ROUND256(a,b,c,d,e,f,g,h) yading@11: yading@11: static void sha256_transform(uint32_t *state, const uint8_t buffer[64]) yading@11: { yading@11: unsigned int i, a, b, c, d, e, f, g, h; yading@11: uint32_t block[64]; yading@11: uint32_t T1; yading@11: yading@11: a = state[0]; yading@11: b = state[1]; yading@11: c = state[2]; yading@11: d = state[3]; yading@11: e = state[4]; yading@11: f = state[5]; yading@11: g = state[6]; yading@11: h = state[7]; yading@11: #if CONFIG_SMALL yading@11: for (i = 0; i < 64; i++) { yading@11: uint32_t T2; yading@11: if (i < 16) yading@11: T1 = blk0(i); yading@11: else yading@11: T1 = blk(i); yading@11: T1 += h + Sigma1_256(e) + Ch(e, f, g) + K256[i]; yading@11: T2 = Sigma0_256(a) + Maj(a, b, c); yading@11: h = g; yading@11: g = f; yading@11: f = e; yading@11: e = d + T1; yading@11: d = c; yading@11: c = b; yading@11: b = a; yading@11: a = T1 + T2; yading@11: } yading@11: #else yading@11: for (i = 0; i < 16 - 7;) { yading@11: ROUND256_0_TO_15(a, b, c, d, e, f, g, h); yading@11: ROUND256_0_TO_15(h, a, b, c, d, e, f, g); yading@11: ROUND256_0_TO_15(g, h, a, b, c, d, e, f); yading@11: ROUND256_0_TO_15(f, g, h, a, b, c, d, e); yading@11: ROUND256_0_TO_15(e, f, g, h, a, b, c, d); yading@11: ROUND256_0_TO_15(d, e, f, g, h, a, b, c); yading@11: ROUND256_0_TO_15(c, d, e, f, g, h, a, b); yading@11: ROUND256_0_TO_15(b, c, d, e, f, g, h, a); yading@11: } yading@11: yading@11: for (; i < 64 - 7;) { yading@11: ROUND256_16_TO_63(a, b, c, d, e, f, g, h); yading@11: ROUND256_16_TO_63(h, a, b, c, d, e, f, g); yading@11: ROUND256_16_TO_63(g, h, a, b, c, d, e, f); yading@11: ROUND256_16_TO_63(f, g, h, a, b, c, d, e); yading@11: ROUND256_16_TO_63(e, f, g, h, a, b, c, d); yading@11: ROUND256_16_TO_63(d, e, f, g, h, a, b, c); yading@11: ROUND256_16_TO_63(c, d, e, f, g, h, a, b); yading@11: ROUND256_16_TO_63(b, c, d, e, f, g, h, a); yading@11: } yading@11: #endif yading@11: state[0] += a; yading@11: state[1] += b; yading@11: state[2] += c; yading@11: state[3] += d; yading@11: state[4] += e; yading@11: state[5] += f; yading@11: state[6] += g; yading@11: state[7] += h; yading@11: } yading@11: yading@11: yading@11: int av_sha_init(AVSHA* ctx, int bits) yading@11: { yading@11: ctx->digest_len = bits >> 5; yading@11: switch (bits) { yading@11: case 160: // SHA-1 yading@11: ctx->state[0] = 0x67452301; yading@11: ctx->state[1] = 0xEFCDAB89; yading@11: ctx->state[2] = 0x98BADCFE; yading@11: ctx->state[3] = 0x10325476; yading@11: ctx->state[4] = 0xC3D2E1F0; yading@11: ctx->transform = sha1_transform; yading@11: break; yading@11: case 224: // SHA-224 yading@11: ctx->state[0] = 0xC1059ED8; yading@11: ctx->state[1] = 0x367CD507; yading@11: ctx->state[2] = 0x3070DD17; yading@11: ctx->state[3] = 0xF70E5939; yading@11: ctx->state[4] = 0xFFC00B31; yading@11: ctx->state[5] = 0x68581511; yading@11: ctx->state[6] = 0x64F98FA7; yading@11: ctx->state[7] = 0xBEFA4FA4; yading@11: ctx->transform = sha256_transform; yading@11: break; yading@11: case 256: // SHA-256 yading@11: ctx->state[0] = 0x6A09E667; yading@11: ctx->state[1] = 0xBB67AE85; yading@11: ctx->state[2] = 0x3C6EF372; yading@11: ctx->state[3] = 0xA54FF53A; yading@11: ctx->state[4] = 0x510E527F; yading@11: ctx->state[5] = 0x9B05688C; yading@11: ctx->state[6] = 0x1F83D9AB; yading@11: ctx->state[7] = 0x5BE0CD19; yading@11: ctx->transform = sha256_transform; yading@11: break; yading@11: default: yading@11: return -1; yading@11: } yading@11: ctx->count = 0; yading@11: return 0; yading@11: } yading@11: yading@11: void av_sha_update(AVSHA* ctx, const uint8_t* data, unsigned int len) yading@11: { yading@11: unsigned int i, j; yading@11: yading@11: j = ctx->count & 63; yading@11: ctx->count += len; yading@11: #if CONFIG_SMALL yading@11: for (i = 0; i < len; i++) { yading@11: ctx->buffer[j++] = data[i]; yading@11: if (64 == j) { yading@11: ctx->transform(ctx->state, ctx->buffer); yading@11: j = 0; yading@11: } yading@11: } yading@11: #else yading@11: if ((j + len) > 63) { yading@11: memcpy(&ctx->buffer[j], data, (i = 64 - j)); yading@11: ctx->transform(ctx->state, ctx->buffer); yading@11: for (; i + 63 < len; i += 64) yading@11: ctx->transform(ctx->state, &data[i]); yading@11: j = 0; yading@11: } else yading@11: i = 0; yading@11: memcpy(&ctx->buffer[j], &data[i], len - i); yading@11: #endif yading@11: } yading@11: yading@11: void av_sha_final(AVSHA* ctx, uint8_t *digest) yading@11: { yading@11: int i; yading@11: uint64_t finalcount = av_be2ne64(ctx->count << 3); yading@11: yading@11: av_sha_update(ctx, "\200", 1); yading@11: while ((ctx->count & 63) != 56) yading@11: av_sha_update(ctx, "", 1); yading@11: av_sha_update(ctx, (uint8_t *)&finalcount, 8); /* Should cause a transform() */ yading@11: for (i = 0; i < ctx->digest_len; i++) yading@11: AV_WB32(digest + i*4, ctx->state[i]); yading@11: } yading@11: yading@11: #ifdef TEST yading@11: #include yading@11: yading@11: int main(void) yading@11: { yading@11: int i, j, k; yading@11: AVSHA ctx; yading@11: unsigned char digest[32]; yading@11: const int lengths[3] = { 160, 224, 256 }; yading@11: yading@11: for (j = 0; j < 3; j++) { yading@11: printf("Testing SHA-%d\n", lengths[j]); yading@11: for (k = 0; k < 3; k++) { yading@11: av_sha_init(&ctx, lengths[j]); yading@11: if (k == 0) yading@11: av_sha_update(&ctx, "abc", 3); yading@11: else if (k == 1) yading@11: av_sha_update(&ctx, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56); yading@11: else yading@11: for (i = 0; i < 1000*1000; i++) yading@11: av_sha_update(&ctx, "a", 1); yading@11: av_sha_final(&ctx, digest); yading@11: for (i = 0; i < lengths[j] >> 3; i++) yading@11: printf("%02X", digest[i]); yading@11: putchar('\n'); yading@11: } yading@11: switch (j) { yading@11: case 0: yading@11: //test vectors (from FIPS PUB 180-1) yading@11: printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n" yading@11: "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n" yading@11: "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n"); yading@11: break; yading@11: case 1: yading@11: //test vectors (from FIPS PUB 180-2 Appendix A) yading@11: printf("23097d22 3405d822 8642a477 bda255b3 2aadbce4 bda0b3f7 e36c9da7\n" yading@11: "75388b16 512776cc 5dba5da1 fd890150 b0c6455c b4f58b19 52522525\n" yading@11: "20794655 980c91d8 bbb4c1ea 97618a4b f03f4258 1948b2ee 4ee7ad67\n"); yading@11: break; yading@11: case 2: yading@11: //test vectors (from FIPS PUB 180-2) yading@11: printf("ba7816bf 8f01cfea 414140de 5dae2223 b00361a3 96177a9c b410ff61 f20015ad\n" yading@11: "248d6a61 d20638b8 e5c02693 0c3e6039 a33ce459 64ff2167 f6ecedd4 19db06c1\n" yading@11: "cdc76e5c 9914fb92 81a1c7e2 84d73e67 f1809a48 a497200e 046d39cc c7112cd0\n"); yading@11: break; yading@11: } yading@11: } yading@11: yading@11: return 0; yading@11: } yading@11: #endif