1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
#include <string.h>
#include "common.h"
#include "sha1.h"
#include "xendian.h"
static inline uint32_t rotl32(uint32_t x, uint8_t bits)
__attribute__((always_inline, const));
static const uint32_t K[] = {
0x5A827999,
0x6ED9EBA1,
0x8F1BBCDC,
0xCA62C1D6,
};
void
sha1hashblk(sha1_t *s, const uint8_t *blk)
{
uint32_t w[80];
uint32_t a, b, c, d, e, tmp;
for (int i = 0; i < 16; i++) {
uint32_t n;
memcpy(&n, blk + i*sizeof(n), sizeof(n));
w[i] = htobe32(n);
}
for (int i = 16; i < 32; i++)
w[i] = rotl32(w[i-3] ^ w[i-8] ^ w[i-14] ^ w[i-16], 1);
for (int i = 32; i < 80; i++)
w[i] = rotl32(w[i-6] ^ w[i-16] ^ w[i-28] ^ w[i-32], 2);
a = s->dgst[0];
b = s->dgst[1];
c = s->dgst[2];
d = s->dgst[3];
e = s->dgst[4];
for (int i = 0; i < 80; i++) {
uint32_t f, k;
if (i < 20) {
f = b&c | ~b&d;
k = K[0];
} else if (i < 40) {
f = b ^ c ^ d;
k = K[1];
} else if (i < 60) {
f = b&c | b&d | c&d;
k = K[2];
} else {
f = b ^ c ^ d;
k = K[3];
}
tmp = rotl32(a, 5) + f + e + w[i] + k;
e = d;
d = c;
c = rotl32(b, 30);
b = a;
a = tmp;
}
s->dgst[0] += a;
s->dgst[1] += b;
s->dgst[2] += c;
s->dgst[3] += d;
s->dgst[4] += e;
}
uint32_t
rotl32(uint32_t x, uint8_t bits)
{
#if (__GNUC__ || __TINYC__) && __x86_64__
__asm__ ("roll %1, %0" : "+r" (x) : "c" (bits) : "cc");
return x;
#elif __GNUC__ && __aarch64__ /* TODO: Test this! */
__asm__ ("ror %0, %0, %1" : "+r" (x) : "c" (-bits));
return x;
#else
return (x << bits) | (x >> (32 - bits));
#endif
}
|
