Statistics
| Branch: | Revision:

ffmpeg / libavutil / sha1.c @ 3884689b

History | View | Annotate | Download (3.94 KB)

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

    
8
typedef 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
#define blk(i) (block[i])
17

    
18
/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
19
#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)    +blk (i)+0x5A827999+rol(v,5);w=rol(w,30);
20
#define R2(v,w,x,y,z,i) z+=( w^x     ^y)    +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
21
#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
22
#define R4(v,w,x,y,z,i) z+=( w^x     ^y)    +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
23

    
24
/* Hash a single 512-bit block. This is the core of the algorithm. */
25

    
26
static void transform(uint32_t state[5], uint8_t buffer[64]){
27
    unsigned int a, b, c, d, e, i;
28
    uint32_t block[80];
29

    
30
    for(i=0; i<16; i++)
31
        block[i]= be2me_32(((uint32_t*)buffer)[i]);
32
    for(;i<80; i++)
33
        block[i]= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1);
34

    
35
    /* Copy context->state[] to working vars */
36
    a = state[0];
37
    b = state[1];
38
    c = state[2];
39
    d = state[3];
40
    e = state[4];
41

    
42
    for(i=0; i<20; i+=5){
43
        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);
44
    }
45
    for(; i<40; i+=5){
46
        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);
47
    }
48
    for(; i<60; i+=5){
49
        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);
50
    }
51
    for(; i<80; i+=5){
52
        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);
53
    }
54

    
55
    state[0] += a;
56
    state[1] += b;
57
    state[2] += c;
58
    state[3] += d;
59
    state[4] += e;
60
}
61

    
62
void av_sha1_init(AVSHA1* context){
63
    context->state[0] = 0x67452301;
64
    context->state[1] = 0xEFCDAB89;
65
    context->state[2] = 0x98BADCFE;
66
    context->state[3] = 0x10325476;
67
    context->state[4] = 0xC3D2E1F0;
68
    context->count    = 0;
69
}
70

    
71
void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){
72
    unsigned int i, j;
73

    
74
    j = context->count & 63;
75
    context->count += len;
76
    if ((j + len) > 63) {
77
        memcpy(&context->buffer[j], data, (i = 64-j));
78
        transform(context->state, context->buffer);
79
        for ( ; i + 63 < len; i += 64) {
80
            transform(context->state, &data[i]);
81
        }
82
    }
83
    else i = 0;
84
    memcpy(&context->buffer[j], &data[i], len - i);
85
}
86

    
87
void av_sha1_final(AVSHA1* context, uint8_t digest[20]){
88
    int i;
89
    uint64_t finalcount= be2me_64(context->count<<3);
90

    
91
    av_sha1_update(context, "\200", 1);
92
    while ((context->count & 63) != 56) {
93
        av_sha1_update(context, "\0", 1);
94
    }
95
    av_sha1_update(context, &finalcount, 8);  /* Should cause a transform() */
96
    for(i=0; i<5; i++)
97
        ((uint32_t*)digest)[i]= be2me_32(context->state[i]);
98
}
99

    
100
// use the following to test
101
// gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1
102
#ifdef TEST
103
#include <stdio.h>
104
#undef printf
105

    
106
int main(){
107
    int i, k;
108
    AVSHA1 context;
109
    unsigned char digest[20];
110

    
111
    for(k=0; k<3; k++){
112
        av_sha1_init(&context);
113
        if(k==0)
114
            av_sha1_update(&context, "abc", 3);
115
        else if(k==1)
116
            av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
117
        else
118
            for(i=0; i<1000*1000; i++)
119
                av_sha1_update(&context, "a", 1);
120
        av_sha1_final(&context, digest);
121
        for (i = 0; i < 20; i++)
122
            printf("%02X", digest[i]);
123
        putchar('\n');
124
    }
125
    //Test Vectors (from FIPS PUB 180-1)
126
    printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
127
           "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
128
           "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");
129

    
130
    return 0;
131
}
132
#endif