Statistics
| Branch: | Revision:

ffmpeg / libavutil / sha1.c @ 10e26bc7

History | View | Annotate | Download (4.72 KB)

1 7c60e55b Michael Niedermayer
// 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
8
typedef struct AVSHA1 {
9
    uint64_t count;
10
    uint8_t buffer[64];
11 20013045 Michael Niedermayer
    uint32_t state[5];
12 7c60e55b Michael Niedermayer
} AVSHA1;
13
14
#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
15
16
/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
17 15b6cae2 Michael Niedermayer
#define blk0(i) (block[i] = be2me_32(((uint32_t*)buffer)[i]))
18 d6cf7804 Michael Niedermayer
#define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1))
19
20
#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)    +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
21
#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)    +blk (i)+0x5A827999+rol(v,5);w=rol(w,30);
22
#define R2(v,w,x,y,z,i) z+=( w^x     ^y)    +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
23
#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
24
#define R4(v,w,x,y,z,i) z+=( w^x     ^y)    +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
25 7c60e55b Michael Niedermayer
26
/* Hash a single 512-bit block. This is the core of the algorithm. */
27
28
static void transform(uint32_t state[5], uint8_t buffer[64]){
29 aa59433a Michael Niedermayer
    uint32_t block[80];
30 5fd7f87b Michael Niedermayer
    unsigned int i, a, b, c, d, e;
31 3479b72b Michael Niedermayer
32 7c60e55b Michael Niedermayer
    a = state[0];
33
    b = state[1];
34
    c = state[2];
35
    d = state[3];
36
    e = state[4];
37 104c30ee Michael Niedermayer
#ifdef CONFIG_SMALL
38 2fa3a22d Michael Niedermayer
    for(i=0; i<80; i++){
39 476f9b74 Michael Niedermayer
        int t;
40
        if(i<16) t= be2me_32(((uint32_t*)buffer)[i]);
41
        else     t= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1);
42
        block[i]= t;
43
        t+= e+rol(a,5);
44 2fa3a22d Michael Niedermayer
        if(i<40){
45
            if(i<20)    t+= ((b&(c^d))^d)    +0x5A827999;
46
            else        t+= ( b^c     ^d)    +0x6ED9EBA1;
47
        }else{
48
            if(i<60)    t+= (((b|c)&d)|(b&c))+0x8F1BBCDC;
49
            else        t+= ( b^c     ^d)    +0xCA62C1D6;
50
        }
51 6573578d Michael Niedermayer
        e= d;
52
        d= c;
53
        c= rol(b,30);
54
        b= a;
55
        a= t;
56
    }
57
#else
58 d6cf7804 Michael Niedermayer
    for(i=0; i<15; i+=5){
59 7c60e55b Michael Niedermayer
        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);
60
    }
61 d6cf7804 Michael Niedermayer
    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);
62
    for(i=20; i<40; i+=5){
63 7c60e55b Michael Niedermayer
        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);
64
    }
65
    for(; i<60; i+=5){
66
        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);
67
    }
68
    for(; i<80; i+=5){
69
        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);
70
    }
71 6573578d Michael Niedermayer
#endif
72 7c60e55b Michael Niedermayer
    state[0] += a;
73
    state[1] += b;
74
    state[2] += c;
75
    state[3] += d;
76
    state[4] += e;
77
}
78
79 248b25f8 Michael Niedermayer
void av_sha1_init(AVSHA1* ctx){
80
    ctx->state[0] = 0x67452301;
81
    ctx->state[1] = 0xEFCDAB89;
82
    ctx->state[2] = 0x98BADCFE;
83
    ctx->state[3] = 0x10325476;
84
    ctx->state[4] = 0xC3D2E1F0;
85
    ctx->count    = 0;
86 7c60e55b Michael Niedermayer
}
87
88 248b25f8 Michael Niedermayer
void av_sha1_update(AVSHA1* ctx, uint8_t* data, unsigned int len){
89 7c60e55b Michael Niedermayer
    unsigned int i, j;
90
91 248b25f8 Michael Niedermayer
    j = ctx->count & 63;
92
    ctx->count += len;
93 36c7fa7e Michael Niedermayer
#ifdef CONFIG_SMALL
94
    for( i = 0; i < len; i++ ){
95 248b25f8 Michael Niedermayer
        ctx->buffer[ j++ ] = data[i];
96 36c7fa7e Michael Niedermayer
        if( 64 == j ){
97 248b25f8 Michael Niedermayer
            transform(ctx->state, ctx->buffer);
98 36c7fa7e Michael Niedermayer
            j = 0;
99
        }
100
    }
101
#else
102 7c60e55b Michael Niedermayer
    if ((j + len) > 63) {
103 248b25f8 Michael Niedermayer
        memcpy(&ctx->buffer[j], data, (i = 64-j));
104
        transform(ctx->state, ctx->buffer);
105 7c60e55b Michael Niedermayer
        for ( ; i + 63 < len; i += 64) {
106 248b25f8 Michael Niedermayer
            transform(ctx->state, &data[i]);
107 7c60e55b Michael Niedermayer
        }
108 965ea9ba Michael Niedermayer
        j=0;
109 7c60e55b Michael Niedermayer
    }
110
    else i = 0;
111 248b25f8 Michael Niedermayer
    memcpy(&ctx->buffer[j], &data[i], len - i);
112 36c7fa7e Michael Niedermayer
#endif
113 7c60e55b Michael Niedermayer
}
114
115 248b25f8 Michael Niedermayer
void av_sha1_final(AVSHA1* ctx, uint8_t digest[20]){
116 7c60e55b Michael Niedermayer
    int i;
117 248b25f8 Michael Niedermayer
    uint64_t finalcount= be2me_64(ctx->count<<3);
118 7c60e55b Michael Niedermayer
119 248b25f8 Michael Niedermayer
    av_sha1_update(ctx, "\200", 1);
120
    while ((ctx->count & 63) != 56) {
121
        av_sha1_update(ctx, "", 1);
122 7c60e55b Michael Niedermayer
    }
123 248b25f8 Michael Niedermayer
    av_sha1_update(ctx, &finalcount, 8);  /* Should cause a transform() */
124 c6fd617a Michael Niedermayer
    for(i=0; i<5; i++)
125 248b25f8 Michael Niedermayer
        ((uint32_t*)digest)[i]= be2me_32(ctx->state[i]);
126 7c60e55b Michael Niedermayer
}
127
128 ae76034c Michael Niedermayer
// use the following to test
129 82da03f7 Michael Niedermayer
// gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1
130 7c60e55b Michael Niedermayer
#ifdef TEST
131
#include <stdio.h>
132
#undef printf
133
134
int main(){
135
    int i, k;
136 248b25f8 Michael Niedermayer
    AVSHA1 ctx;
137 7c60e55b Michael Niedermayer
    unsigned char digest[20];
138
139
    for(k=0; k<3; k++){
140 248b25f8 Michael Niedermayer
        av_sha1_init(&ctx);
141 7c60e55b Michael Niedermayer
        if(k==0)
142 248b25f8 Michael Niedermayer
            av_sha1_update(&ctx, "abc", 3);
143 7c60e55b Michael Niedermayer
        else if(k==1)
144 248b25f8 Michael Niedermayer
            av_sha1_update(&ctx, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
145 7c60e55b Michael Niedermayer
        else
146
            for(i=0; i<1000*1000; i++)
147 248b25f8 Michael Niedermayer
                av_sha1_update(&ctx, "a", 1);
148
        av_sha1_final(&ctx, digest);
149 7c60e55b Michael Niedermayer
        for (i = 0; i < 20; i++)
150
            printf("%02X", digest[i]);
151
        putchar('\n');
152
    }
153
    //Test Vectors (from FIPS PUB 180-1)
154
    printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
155
           "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
156
           "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");
157
158
    return 0;
159
}
160
#endif