2 * Copyright (C) 2007 Michael Niedermayer <michaelni@gmx.at>
3 * based on public domain SHA-1 code by Steve Reid <steve@edmweb.com>
5 * This file is part of FFmpeg.
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
27 typedef struct AVSHA1 {
28 uint8_t digest_len; ///< digest length in 32-bit words
29 uint64_t count; ///< number of bytes in buffer
30 uint8_t buffer[64]; ///< 512-bit buffer of input values used in hash updating
31 uint32_t state[8]; ///< current hash value
34 const int av_sha1_size = sizeof(AVSHA1);
36 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
38 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
39 #define blk0(i) (block[i] = be2me_32(((const uint32_t*)buffer)[i]))
40 #define blk(i) (block[i] = rol(block[i-3] ^ block[i-8] ^ block[i-14] ^ block[i-16], 1))
42 #define R0(v,w,x,y,z,i) z += ((w&(x^y))^y) + blk0(i) + 0x5A827999 + rol(v, 5); w = rol(w, 30);
43 #define R1(v,w,x,y,z,i) z += ((w&(x^y))^y) + blk (i) + 0x5A827999 + rol(v, 5); w = rol(w, 30);
44 #define R2(v,w,x,y,z,i) z += ( w^x ^y) + blk (i) + 0x6ED9EBA1 + rol(v, 5); w = rol(w, 30);
45 #define R3(v,w,x,y,z,i) z += (((w|x)&y)|(w&x)) + blk (i) + 0x8F1BBCDC + rol(v, 5); w = rol(w, 30);
46 #define R4(v,w,x,y,z,i) z += ( w^x ^y) + blk (i) + 0xCA62C1D6 + rol(v, 5); w = rol(w, 30);
48 /* Hash a single 512-bit block. This is the core of the algorithm. */
50 static void transform(uint32_t state[5], const uint8_t buffer[64])
53 unsigned int i, a, b, c, d, e;
61 for (i = 0; i < 80; i++) {
64 t = be2me_32(((uint32_t*)buffer)[i]);
66 t = rol(block[i-3] ^ block[i-8] ^ block[i-14] ^ block[i-16], 1);
71 t += ((b&(c^d))^d) + 0x5A827999;
73 t += ( b^c ^d) + 0x6ED9EBA1;
76 t += (((b|c)&d)|(b&c)) + 0x8F1BBCDC;
78 t += ( b^c ^d) + 0xCA62C1D6;
87 for (i = 0; i < 15; i += 5) {
88 R0(a, b, c, d, e, 0 + i);
89 R0(e, a, b, c, d, 1 + i);
90 R0(d, e, a, b, c, 2 + i);
91 R0(c, d, e, a, b, 3 + i);
92 R0(b, c, d, e, a, 4 + i);
94 R0(a, b, c, d, e, 15);
95 R1(e, a, b, c, d, 16);
96 R1(d, e, a, b, c, 17);
97 R1(c, d, e, a, b, 18);
98 R1(b, c, d, e, a, 19);
99 for (i = 20; i < 40; i += 5) {
100 R2(a, b, c, d, e, 0 + i);
101 R2(e, a, b, c, d, 1 + i);
102 R2(d, e, a, b, c, 2 + i);
103 R2(c, d, e, a, b, 3 + i);
104 R2(b, c, d, e, a, 4 + i);
106 for (; i < 60; i += 5) {
107 R3(a, b, c, d, e, 0 + i);
108 R3(e, a, b, c, d, 1 + i);
109 R3(d, e, a, b, c, 2 + i);
110 R3(c, d, e, a, b, 3 + i);
111 R3(b, c, d, e, a, 4 + i);
113 for (; i < 80; i += 5) {
114 R4(a, b, c, d, e, 0 + i);
115 R4(e, a, b, c, d, 1 + i);
116 R4(d, e, a, b, c, 2 + i);
117 R4(c, d, e, a, b, 3 + i);
118 R4(b, c, d, e, a, 4 + i);
128 void av_sha1_init(AVSHA1* ctx)
130 ctx->state[0] = 0x67452301;
131 ctx->state[1] = 0xEFCDAB89;
132 ctx->state[2] = 0x98BADCFE;
133 ctx->state[3] = 0x10325476;
134 ctx->state[4] = 0xC3D2E1F0;
138 void av_sha1_update(AVSHA1* ctx, const uint8_t* data, unsigned int len)
145 for (i = 0; i < len; i++) {
146 ctx->buffer[j++] = data[i];
148 transform(ctx->state, ctx->buffer);
153 if ((j + len) > 63) {
154 memcpy(&ctx->buffer[j], data, (i = 64 - j));
155 transform(ctx->state, ctx->buffer);
156 for (; i + 63 < len; i += 64)
157 transform(ctx->state, &data[i]);
161 memcpy(&ctx->buffer[j], &data[i], len - i);
165 void av_sha1_final(AVSHA1* ctx, uint8_t digest[20])
168 uint64_t finalcount = be2me_64(ctx->count << 3);
170 av_sha1_update(ctx, "\200", 1);
171 while ((ctx->count & 63) != 56)
172 av_sha1_update(ctx, "", 1);
173 av_sha1_update(ctx, (uint8_t *)&finalcount, 8); /* Should cause a transform() */
174 for (i = 0; i < 5; i++)
175 ((uint32_t*)digest)[i] = be2me_32(ctx->state[i]);
186 unsigned char digest[20];
188 for (k = 0; k < 3; k++) {
191 av_sha1_update(&ctx, "abc", 3);
193 av_sha1_update(&ctx, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
195 for (i = 0; i < 1000 * 1000; i++)
196 av_sha1_update(&ctx, "a", 1);
197 av_sha1_final(&ctx, digest);
198 for (i = 0; i < 20; i++)
199 printf("%02X", digest[i]);
202 //test vectors (from FIPS PUB 180-1)
203 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
204 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
205 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");