Remove misleading comment about how to build SHA1 test program.
[libav.git] / libavutil / sha1.c
CommitLineData
3d44f15c
DB
1/*
2 * Copyright (C) 2007 Michael Niedermayer <michaelni@gmx.at>
3 * based on public domain SHA-1 code by Steve Reid <steve@edmweb.com>
4 *
5 * This file is part of FFmpeg.
6 *
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.
11 *
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.
16 *
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
20 */
7c60e55b
MN
21
22#include "common.h"
69ae9478 23#include "bswap.h"
7c60e55b
MN
24#include "sha1.h"
25
26typedef struct AVSHA1 {
7c60e55b
MN
27 uint64_t count;
28 uint8_t buffer[64];
20013045 29 uint32_t state[5];
7c60e55b
MN
30} AVSHA1;
31
537c8e7a
LB
32const int av_sha1_size = sizeof(AVSHA1);
33
7c60e55b
MN
34#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
35
7c60e55b 36/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
f522310b 37#define blk0(i) (block[i] = be2me_32(((const uint32_t*)buffer)[i]))
d6cf7804
MN
38#define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1))
39
40#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
41#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk (i)+0x5A827999+rol(v,5);w=rol(w,30);
42#define R2(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
43#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
44#define R4(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
7c60e55b
MN
45
46/* Hash a single 512-bit block. This is the core of the algorithm. */
47
f522310b 48static void transform(uint32_t state[5], const uint8_t buffer[64]){
aa59433a 49 uint32_t block[80];
5fd7f87b 50 unsigned int i, a, b, c, d, e;
3479b72b 51
7c60e55b
MN
52 a = state[0];
53 b = state[1];
54 c = state[2];
55 d = state[3];
56 e = state[4];
b250f9c6 57#if CONFIG_SMALL
2fa3a22d 58 for(i=0; i<80; i++){
476f9b74
MN
59 int t;
60 if(i<16) t= be2me_32(((uint32_t*)buffer)[i]);
61 else t= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1);
62 block[i]= t;
63 t+= e+rol(a,5);
2fa3a22d
MN
64 if(i<40){
65 if(i<20) t+= ((b&(c^d))^d) +0x5A827999;
66 else t+= ( b^c ^d) +0x6ED9EBA1;
67 }else{
68 if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC;
69 else t+= ( b^c ^d) +0xCA62C1D6;
70 }
6573578d
MN
71 e= d;
72 d= c;
73 c= rol(b,30);
74 b= a;
75 a= t;
76 }
77#else
d6cf7804 78 for(i=0; i<15; i+=5){
7c60e55b
MN
79 R0(a,b,c,d,e,0+i); R0(e,a,b,c,d,1+i); R0(d,e,a,b,c,2+i); R0(c,d,e,a,b,3+i); R0(b,c,d,e,a,4+i);
80 }
d6cf7804
MN
81 R0(a,b,c,d,e,15); 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);
82 for(i=20; i<40; i+=5){
7c60e55b
MN
83 R2(a,b,c,d,e,0+i); R2(e,a,b,c,d,1+i); R2(d,e,a,b,c,2+i); R2(c,d,e,a,b,3+i); R2(b,c,d,e,a,4+i);
84 }
85 for(; i<60; i+=5){
86 R3(a,b,c,d,e,0+i); R3(e,a,b,c,d,1+i); R3(d,e,a,b,c,2+i); R3(c,d,e,a,b,3+i); R3(b,c,d,e,a,4+i);
87 }
88 for(; i<80; i+=5){
89 R4(a,b,c,d,e,0+i); R4(e,a,b,c,d,1+i); R4(d,e,a,b,c,2+i); R4(c,d,e,a,b,3+i); R4(b,c,d,e,a,4+i);
90 }
6573578d 91#endif
7c60e55b
MN
92 state[0] += a;
93 state[1] += b;
94 state[2] += c;
95 state[3] += d;
96 state[4] += e;
97}
98
248b25f8
MN
99void av_sha1_init(AVSHA1* ctx){
100 ctx->state[0] = 0x67452301;
101 ctx->state[1] = 0xEFCDAB89;
102 ctx->state[2] = 0x98BADCFE;
103 ctx->state[3] = 0x10325476;
104 ctx->state[4] = 0xC3D2E1F0;
105 ctx->count = 0;
7c60e55b
MN
106}
107
f522310b 108void av_sha1_update(AVSHA1* ctx, const uint8_t* data, unsigned int len){
7c60e55b
MN
109 unsigned int i, j;
110
248b25f8
MN
111 j = ctx->count & 63;
112 ctx->count += len;
b250f9c6 113#if CONFIG_SMALL
36c7fa7e 114 for( i = 0; i < len; i++ ){
248b25f8 115 ctx->buffer[ j++ ] = data[i];
36c7fa7e 116 if( 64 == j ){
248b25f8 117 transform(ctx->state, ctx->buffer);
36c7fa7e
MN
118 j = 0;
119 }
120 }
121#else
7c60e55b 122 if ((j + len) > 63) {
248b25f8
MN
123 memcpy(&ctx->buffer[j], data, (i = 64-j));
124 transform(ctx->state, ctx->buffer);
7c60e55b 125 for ( ; i + 63 < len; i += 64) {
248b25f8 126 transform(ctx->state, &data[i]);
7c60e55b 127 }
965ea9ba 128 j=0;
7c60e55b
MN
129 }
130 else i = 0;
248b25f8 131 memcpy(&ctx->buffer[j], &data[i], len - i);
36c7fa7e 132#endif
7c60e55b
MN
133}
134
248b25f8 135void av_sha1_final(AVSHA1* ctx, uint8_t digest[20]){
7c60e55b 136 int i;
248b25f8 137 uint64_t finalcount= be2me_64(ctx->count<<3);
7c60e55b 138
248b25f8
MN
139 av_sha1_update(ctx, "\200", 1);
140 while ((ctx->count & 63) != 56) {
141 av_sha1_update(ctx, "", 1);
7c60e55b 142 }
0bc308de 143 av_sha1_update(ctx, (uint8_t *)&finalcount, 8); /* Should cause a transform() */
c6fd617a 144 for(i=0; i<5; i++)
248b25f8 145 ((uint32_t*)digest)[i]= be2me_32(ctx->state[i]);
7c60e55b
MN
146}
147
148#ifdef TEST
149#include <stdio.h>
150#undef printf
151
f8a80fd6 152int main(void){
7c60e55b 153 int i, k;
248b25f8 154 AVSHA1 ctx;
7c60e55b
MN
155 unsigned char digest[20];
156
157 for(k=0; k<3; k++){
248b25f8 158 av_sha1_init(&ctx);
7c60e55b 159 if(k==0)
248b25f8 160 av_sha1_update(&ctx, "abc", 3);
7c60e55b 161 else if(k==1)
248b25f8 162 av_sha1_update(&ctx, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
7c60e55b
MN
163 else
164 for(i=0; i<1000*1000; i++)
248b25f8
MN
165 av_sha1_update(&ctx, "a", 1);
166 av_sha1_final(&ctx, digest);
7c60e55b
MN
167 for (i = 0; i < 20; i++)
168 printf("%02X", digest[i]);
169 putchar('\n');
170 }
171 //Test Vectors (from FIPS PUB 180-1)
172 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
173 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
174 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");
175
176 return 0;
177}
178#endif