simple SHA-1 implementation
[libav.git] / libavutil / sha1.c
CommitLineData
7c60e55b
MN
1// SHA-1 code Copyright 2007 Michael Nidermayer <michaelni@gmx.at>
2// license LGPL
3// based on public domain SHA-1 code by Steve Reid <steve@edmweb.com>
4
5#include "common.h"
6#include "sha1.h"
7
8typedef struct AVSHA1 {
9 uint32_t state[5];
10 uint64_t count;
11 uint8_t buffer[64];
12} AVSHA1;
13
14#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
15
16/* blk0() and blk() perform the initial expand. */
17/* I got the idea of expanding during the round function from SSLeay */
18#define blk0(i) (block[i] = be2me_32(block[i]))
19#define blk(i) (block[i&15] = rol(block[(i+13)&15]^block[(i+8)&15]^block[(i+2)&15]^block[i&15],1))
20
21/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
22#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
23#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk (i)+0x5A827999+rol(v,5);w=rol(w,30);
24#define R2(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
25#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
26#define R4(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
27
28/* Hash a single 512-bit block. This is the core of the algorithm. */
29
30static void transform(uint32_t state[5], uint8_t buffer[64]){
31 unsigned int a, b, c, d, e, i;
32 uint32_t* block= buffer;
33 /* Copy context->state[] to working vars */
34 a = state[0];
35 b = state[1];
36 c = state[2];
37 d = state[3];
38 e = state[4];
39#if 1
40 for(i=0; i<15; i+=5){
41 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);
42 }
43 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);
44 for(i=20; i<40; i+=5){
45 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);
46 }
47 for(; i<60; i+=5){
48 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);
49 }
50 for(; i<80; i+=5){
51 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);
52 }
53#else
54 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);
55 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);
56 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);
57 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);
58 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);
59 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);
60 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);
61 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);
62 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);
63 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);
64 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);
65 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);
66 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);
67 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);
68 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);
69 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);
70 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);
71 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);
72 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);
73 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);
74#endif
75 state[0] += a;
76 state[1] += b;
77 state[2] += c;
78 state[3] += d;
79 state[4] += e;
80}
81
82void av_sha1_init(AVSHA1* context){
83 context->state[0] = 0x67452301;
84 context->state[1] = 0xEFCDAB89;
85 context->state[2] = 0x98BADCFE;
86 context->state[3] = 0x10325476;
87 context->state[4] = 0xC3D2E1F0;
88 context->count = 0;
89}
90
91void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){
92 unsigned int i, j;
93
94 j = (context->count >> 3) & 63;
95 context->count += len << 3;
96 if ((j + len) > 63) {
97 memcpy(&context->buffer[j], data, (i = 64-j));
98 transform(context->state, context->buffer);
99 for ( ; i + 63 < len; i += 64) {
100 transform(context->state, &data[i]);
101 }
102 }
103 else i = 0;
104 memcpy(&context->buffer[j], &data[i], len - i);
105}
106
107void av_sha1_final(AVSHA1* context, uint8_t digest[20]){
108 int i;
109 uint64_t finalcount= be2me_64(context->count);
110
111 av_sha1_update(context, "\200", 1);
112 while ((context->count & 504) != 448) {
113 av_sha1_update(context, "\0", 1);
114 }
115 av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */
116 for (i = 0; i < 20; i++) {
117 digest[i] = context->state[i>>2] >> ((3-(i & 3)) * 8) ;
118 }
119}
120
121#ifdef TEST
122#include <stdio.h>
123#undef printf
124
125int main(){
126 int i, k;
127 AVSHA1 context;
128 unsigned char digest[20];
129
130 for(k=0; k<3; k++){
131 av_sha1_init(&context);
132 if(k==0)
133 av_sha1_update(&context, "abc", 3);
134 else if(k==1)
135 av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
136 else
137 for(i=0; i<1000*1000; i++)
138 av_sha1_update(&context, "a", 1);
139 av_sha1_final(&context, digest);
140 for (i = 0; i < 20; i++)
141 printf("%02X", digest[i]);
142 putchar('\n');
143 }
144 //Test Vectors (from FIPS PUB 180-1)
145 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
146 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
147 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");
148
149 return 0;
150}
151#endif