1 /* LibTomCrypt, modular cryptographic library -- Tom St Denis
3 * LibTomCrypt is a library that provides various cryptographic
4 * algorithms in a highly modular and flexible manner.
6 * The library is free for all purposes without any express
13 Submitted by Dobes Vandermeer (dobes@smartt.com)
18 const struct ltc_hash_descriptor md4_desc =
26 { 1, 2, 840, 113549, 2, 4, },
49 /* F, G and H are basic LTC_MD4 functions. */
50 #define F(x, y, z) (z ^ (x & (y ^ z)))
51 #define G(x, y, z) ((x & y) | (z & (x | y)))
52 #define H(x, y, z) ((x) ^ (y) ^ (z))
54 /* ROTATE_LEFT rotates x left n bits. */
55 #define ROTATE_LEFT(x, n) ROLc(x, n)
57 /* FF, GG and HH are transformations for rounds 1, 2 and 3 */
58 /* Rotation is separate from addition to prevent recomputation */
60 #define FF(a, b, c, d, x, s) { \
61 (a) += F ((b), (c), (d)) + (x); \
62 (a) = ROTATE_LEFT ((a), (s)); \
64 #define GG(a, b, c, d, x, s) { \
65 (a) += G ((b), (c), (d)) + (x) + 0x5a827999UL; \
66 (a) = ROTATE_LEFT ((a), (s)); \
68 #define HH(a, b, c, d, x, s) { \
69 (a) += H ((b), (c), (d)) + (x) + 0x6ed9eba1UL; \
70 (a) = ROTATE_LEFT ((a), (s)); \
73 #ifdef LTC_CLEAN_STACK
74 static int _md4_compress(hash_state *md, unsigned char *buf)
76 static int md4_compress(hash_state *md, unsigned char *buf)
79 ulong32 x[16], a, b, c, d;
88 /* copy the state into 512-bits into W[0..15] */
89 for (i = 0; i < 16; i++) {
90 LOAD32L(x[i], buf + (4*i));
94 FF (a, b, c, d, x[ 0], S11); /* 1 */
95 FF (d, a, b, c, x[ 1], S12); /* 2 */
96 FF (c, d, a, b, x[ 2], S13); /* 3 */
97 FF (b, c, d, a, x[ 3], S14); /* 4 */
98 FF (a, b, c, d, x[ 4], S11); /* 5 */
99 FF (d, a, b, c, x[ 5], S12); /* 6 */
100 FF (c, d, a, b, x[ 6], S13); /* 7 */
101 FF (b, c, d, a, x[ 7], S14); /* 8 */
102 FF (a, b, c, d, x[ 8], S11); /* 9 */
103 FF (d, a, b, c, x[ 9], S12); /* 10 */
104 FF (c, d, a, b, x[10], S13); /* 11 */
105 FF (b, c, d, a, x[11], S14); /* 12 */
106 FF (a, b, c, d, x[12], S11); /* 13 */
107 FF (d, a, b, c, x[13], S12); /* 14 */
108 FF (c, d, a, b, x[14], S13); /* 15 */
109 FF (b, c, d, a, x[15], S14); /* 16 */
112 GG (a, b, c, d, x[ 0], S21); /* 17 */
113 GG (d, a, b, c, x[ 4], S22); /* 18 */
114 GG (c, d, a, b, x[ 8], S23); /* 19 */
115 GG (b, c, d, a, x[12], S24); /* 20 */
116 GG (a, b, c, d, x[ 1], S21); /* 21 */
117 GG (d, a, b, c, x[ 5], S22); /* 22 */
118 GG (c, d, a, b, x[ 9], S23); /* 23 */
119 GG (b, c, d, a, x[13], S24); /* 24 */
120 GG (a, b, c, d, x[ 2], S21); /* 25 */
121 GG (d, a, b, c, x[ 6], S22); /* 26 */
122 GG (c, d, a, b, x[10], S23); /* 27 */
123 GG (b, c, d, a, x[14], S24); /* 28 */
124 GG (a, b, c, d, x[ 3], S21); /* 29 */
125 GG (d, a, b, c, x[ 7], S22); /* 30 */
126 GG (c, d, a, b, x[11], S23); /* 31 */
127 GG (b, c, d, a, x[15], S24); /* 32 */
130 HH (a, b, c, d, x[ 0], S31); /* 33 */
131 HH (d, a, b, c, x[ 8], S32); /* 34 */
132 HH (c, d, a, b, x[ 4], S33); /* 35 */
133 HH (b, c, d, a, x[12], S34); /* 36 */
134 HH (a, b, c, d, x[ 2], S31); /* 37 */
135 HH (d, a, b, c, x[10], S32); /* 38 */
136 HH (c, d, a, b, x[ 6], S33); /* 39 */
137 HH (b, c, d, a, x[14], S34); /* 40 */
138 HH (a, b, c, d, x[ 1], S31); /* 41 */
139 HH (d, a, b, c, x[ 9], S32); /* 42 */
140 HH (c, d, a, b, x[ 5], S33); /* 43 */
141 HH (b, c, d, a, x[13], S34); /* 44 */
142 HH (a, b, c, d, x[ 3], S31); /* 45 */
143 HH (d, a, b, c, x[11], S32); /* 46 */
144 HH (c, d, a, b, x[ 7], S33); /* 47 */
145 HH (b, c, d, a, x[15], S34); /* 48 */
148 /* Update our state */
149 md->md4.state[0] = md->md4.state[0] + a;
150 md->md4.state[1] = md->md4.state[1] + b;
151 md->md4.state[2] = md->md4.state[2] + c;
152 md->md4.state[3] = md->md4.state[3] + d;
157 #ifdef LTC_CLEAN_STACK
158 static int md4_compress(hash_state *md, unsigned char *buf)
161 err = _md4_compress(md, buf);
162 burn_stack(sizeof(ulong32) * 20 + sizeof(int));
168 Initialize the hash state
169 @param md The hash state you wish to initialize
170 @return CRYPT_OK if successful
172 int md4_init(hash_state * md)
174 LTC_ARGCHK(md != NULL);
175 md->md4.state[0] = 0x67452301UL;
176 md->md4.state[1] = 0xefcdab89UL;
177 md->md4.state[2] = 0x98badcfeUL;
178 md->md4.state[3] = 0x10325476UL;
185 Process a block of memory though the hash
186 @param md The hash state
187 @param in The data to hash
188 @param inlen The length of the data (octets)
189 @return CRYPT_OK if successful
191 HASH_PROCESS(md4_process, md4_compress, md4, 64)
194 Terminate the hash to get the digest
195 @param md The hash state
196 @param out [out] The destination of the hash (16 bytes)
197 @return CRYPT_OK if successful
199 int md4_done(hash_state * md, unsigned char *out)
203 LTC_ARGCHK(md != NULL);
204 LTC_ARGCHK(out != NULL);
206 if (md->md4.curlen >= sizeof(md->md4.buf)) {
207 return CRYPT_INVALID_ARG;
210 /* increase the length of the message */
211 md->md4.length += md->md4.curlen * 8;
213 /* append the '1' bit */
214 md->md4.buf[md->md4.curlen++] = (unsigned char)0x80;
216 /* if the length is currently above 56 bytes we append zeros
217 * then compress. Then we can fall back to padding zeros and length
218 * encoding like normal.
220 if (md->md4.curlen > 56) {
221 while (md->md4.curlen < 64) {
222 md->md4.buf[md->md4.curlen++] = (unsigned char)0;
224 md4_compress(md, md->md4.buf);
228 /* pad upto 56 bytes of zeroes */
229 while (md->md4.curlen < 56) {
230 md->md4.buf[md->md4.curlen++] = (unsigned char)0;
234 STORE64L(md->md4.length, md->md4.buf+56);
235 md4_compress(md, md->md4.buf);
238 for (i = 0; i < 4; i++) {
239 STORE32L(md->md4.state[i], out+(4*i));
241 #ifdef LTC_CLEAN_STACK
242 zeromem(md, sizeof(hash_state));
249 @return CRYPT_OK if successful, CRYPT_NOP if self-tests have been disabled
256 static const struct md4_test_case {
258 unsigned char hash[16];
261 {0x31, 0xd6, 0xcf, 0xe0, 0xd1, 0x6a, 0xe9, 0x31,
262 0xb7, 0x3c, 0x59, 0xd7, 0xe0, 0xc0, 0x89, 0xc0} },
264 {0xbd, 0xe5, 0x2c, 0xb3, 0x1d, 0xe3, 0x3e, 0x46,
265 0x24, 0x5e, 0x05, 0xfb, 0xdb, 0xd6, 0xfb, 0x24} },
267 {0xa4, 0x48, 0x01, 0x7a, 0xaf, 0x21, 0xd8, 0x52,
268 0x5f, 0xc1, 0x0a, 0xe8, 0x7a, 0xa6, 0x72, 0x9d} },
270 {0xd9, 0x13, 0x0a, 0x81, 0x64, 0x54, 0x9f, 0xe8,
271 0x18, 0x87, 0x48, 0x06, 0xe1, 0xc7, 0x01, 0x4b} },
272 { "abcdefghijklmnopqrstuvwxyz",
273 {0xd7, 0x9e, 0x1c, 0x30, 0x8a, 0xa5, 0xbb, 0xcd,
274 0xee, 0xa8, 0xed, 0x63, 0xdf, 0x41, 0x2d, 0xa9} },
275 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
276 {0x04, 0x3f, 0x85, 0x82, 0xf2, 0x41, 0xdb, 0x35,
277 0x1c, 0xe6, 0x27, 0xe1, 0x53, 0xe7, 0xf0, 0xe4} },
278 { "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
279 {0xe3, 0x3b, 0x4d, 0xdc, 0x9c, 0x38, 0xf2, 0x19,
280 0x9c, 0x3e, 0x7b, 0x16, 0x4f, 0xcc, 0x05, 0x36} },
284 unsigned char tmp[16];
287 for(i = 0; i < (int)(sizeof(tests) / sizeof(tests[0])); i++) {
289 md4_process(&md, (unsigned char *)tests[i].input, (unsigned long)strlen(tests[i].input));
291 if (compare_testvector(tmp, sizeof(tmp), tests[i].hash, sizeof(tests[i].hash), "MD4", i)) {
292 return CRYPT_FAIL_TESTVECTOR;
304 /* ref: $Format:%D$ */
305 /* git commit: $Format:%H$ */
306 /* commit time: $Format:%ai$ */