forked from nayuki/Native-hashes-for-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmd4-compress.c
More file actions
101 lines (93 loc) · 2.84 KB
/
md4-compress.c
File metadata and controls
101 lines (93 loc) · 2.84 KB
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/*
* Native hash functions for Java
*
* Copyright (c) Project Nayuki. (MIT License)
* https://www.nayuki.io/page/native-hash-functions-for-java
*/
#include <stdint.h>
#include <jni.h>
void md4_compress_block(const jbyte *block, uint32_t state[4]) {
#define LOADSCHEDULE(i) \
schedule[i] = (uint32_t)(uint8_t)block[i * 4 + 0] << 0 \
| (uint32_t)(uint8_t)block[i * 4 + 1] << 8 \
| (uint32_t)(uint8_t)block[i * 4 + 2] << 16 \
| (uint32_t)(uint8_t)block[i * 4 + 3] << 24;
uint32_t schedule[16];
LOADSCHEDULE( 0)
LOADSCHEDULE( 1)
LOADSCHEDULE( 2)
LOADSCHEDULE( 3)
LOADSCHEDULE( 4)
LOADSCHEDULE( 5)
LOADSCHEDULE( 6)
LOADSCHEDULE( 7)
LOADSCHEDULE( 8)
LOADSCHEDULE( 9)
LOADSCHEDULE(10)
LOADSCHEDULE(11)
LOADSCHEDULE(12)
LOADSCHEDULE(13)
LOADSCHEDULE(14)
LOADSCHEDULE(15)
#define ROTL32(x, n) (((0U + (x)) << (n)) | ((x) >> (32 - (n)))) // Assumes that x is uint32_t and 0 < n < 32
#define ROUND0(a, b, c, d, k, s) ROUND_TAIL(a, d ^ (b & (c ^ d)) , k, s, 0x00000000)
#define ROUND1(a, b, c, d, k, s) ROUND_TAIL(a, (b & c) | (d & (b | c)), k, s, 0x5A827999)
#define ROUND2(a, b, c, d, k, s) ROUND_TAIL(a, b ^ c ^ d , k, s, 0x6ED9EBA1)
#define ROUND_TAIL(a, expr, k, s, t) a = 0U + a + (expr) + schedule[k] + UINT32_C(t); a = ROTL32(a, s);
uint32_t a = state[0];
uint32_t b = state[1];
uint32_t c = state[2];
uint32_t d = state[3];
ROUND0(a, b, c, d, 0, 3)
ROUND0(d, a, b, c, 1, 7)
ROUND0(c, d, a, b, 2, 11)
ROUND0(b, c, d, a, 3, 19)
ROUND0(a, b, c, d, 4, 3)
ROUND0(d, a, b, c, 5, 7)
ROUND0(c, d, a, b, 6, 11)
ROUND0(b, c, d, a, 7, 19)
ROUND0(a, b, c, d, 8, 3)
ROUND0(d, a, b, c, 9, 7)
ROUND0(c, d, a, b, 10, 11)
ROUND0(b, c, d, a, 11, 19)
ROUND0(a, b, c, d, 12, 3)
ROUND0(d, a, b, c, 13, 7)
ROUND0(c, d, a, b, 14, 11)
ROUND0(b, c, d, a, 15, 19)
ROUND1(a, b, c, d, 0, 3)
ROUND1(d, a, b, c, 4, 5)
ROUND1(c, d, a, b, 8, 9)
ROUND1(b, c, d, a, 12, 13)
ROUND1(a, b, c, d, 1, 3)
ROUND1(d, a, b, c, 5, 5)
ROUND1(c, d, a, b, 9, 9)
ROUND1(b, c, d, a, 13, 13)
ROUND1(a, b, c, d, 2, 3)
ROUND1(d, a, b, c, 6, 5)
ROUND1(c, d, a, b, 10, 9)
ROUND1(b, c, d, a, 14, 13)
ROUND1(a, b, c, d, 3, 3)
ROUND1(d, a, b, c, 7, 5)
ROUND1(c, d, a, b, 11, 9)
ROUND1(b, c, d, a, 15, 13)
ROUND2(a, b, c, d, 0, 3)
ROUND2(d, a, b, c, 8, 9)
ROUND2(c, d, a, b, 4, 11)
ROUND2(b, c, d, a, 12, 15)
ROUND2(a, b, c, d, 2, 3)
ROUND2(d, a, b, c, 10, 9)
ROUND2(c, d, a, b, 6, 11)
ROUND2(b, c, d, a, 14, 15)
ROUND2(a, b, c, d, 1, 3)
ROUND2(d, a, b, c, 9, 9)
ROUND2(c, d, a, b, 5, 11)
ROUND2(b, c, d, a, 13, 15)
ROUND2(a, b, c, d, 3, 3)
ROUND2(d, a, b, c, 11, 9)
ROUND2(c, d, a, b, 7, 11)
ROUND2(b, c, d, a, 15, 15)
state[0] = 0U + state[0] + a;
state[1] = 0U + state[1] + b;
state[2] = 0U + state[2] + c;
state[3] = 0U + state[3] + d;
}