4 * Copyright 2007 Develer S.r.l. (http://www.develer.com/)
5 * This file is part of DevLib - See README.devlib for information.
8 * \brief MD2 Message-Digest algorithm.
11 * \author Daniele Basile <asterix@develer.com>
16 *#* Revision 1.14 2007/02/06 09:47:53 asterix
19 *#* Revision 1.13 2007/02/05 18:44:42 asterix
20 *#* Add md2_perm function.
22 *#* Revision 1.12 2007/02/05 16:52:44 asterix
23 *#* Add define for harvard architecture.
25 *#* Revision 1.11 2007/02/02 18:15:31 asterix
26 *#* Add function MD2_test. Fix bug in md2_update function.
28 *#* Revision 1.9 2007/02/02 13:10:01 asterix
29 *#* Fix some bugs in md2_pad and md2_update fuction.
31 *#* Revision 1.8 2007/02/01 14:45:56 asterix
32 *#* Rewrite md2_update function and fix some bug.
34 *#* Revision 1.7 2007/01/31 18:04:15 asterix
35 *#* Write md2_end function
37 *#* Revision 1.4 2007/01/31 13:51:57 asterix
38 *#* Write md2_compute function.
40 *#* Revision 1.2 2007/01/30 17:31:44 asterix
41 *#* Add function prototypes.
43 *#* Revision 1.1 2007/01/30 15:53:26 batt
44 *#* Add first md2 skel.
50 #include <string.h> //memset(), memcpy();
51 #include <cfg/compiler.h>
52 #include <cfg/debug.h> //ASSERT()
53 #include <cfg/macros.h> //MIN(), countof();
54 #include <mware/pgm.h>
57 #ifdef STD_PERMUTATION
59 * Official array of 256 byte pemutation contructed from digits of pi, defined
62 static const uint8_t PROGMEM md2_perm[256] =
64 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,
65 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,
66 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,
67 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,
68 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,
69 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,
70 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,
71 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,
72 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,
73 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,
74 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,
75 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,
76 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,
77 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,
78 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,
79 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,
80 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,
81 31, 26, 219, 153, 141, 51, 159, 17, 131, 20
85 * Md2_perm() function generate an array of 256 "casual" permutation.
89 * Costant define for computing an array of 256 "casual" permutation.
98 uint8_t md2_perm(uint8_t i)
102 i = (i >> R) ^ (i << R); //Rotate i for R times.
113 #ifdef STD_PERMUTATION
114 #define MD2_PERM(x) pgm_read_char(&md2_permr[x]) //Read from program memory, if CPU is harvard
116 #define MD2_PERM(x) pgm_read_char(&md2_permr(x)) //Read from program memory, if CPU is harvard
119 #ifdef STD_PERMUTATION
120 #define MD2_PERM(x) md2_perm[x] //
122 #define MD2_PERM(x) md2_perm(x) //
127 * Pad function. Put len_pad unsigned char in
130 static void md2_pad(void *_block, size_t len_pad)
134 block = (uint8_t *)_block;
136 ASSERT(len_pad <= CONFIG_MD2_BLOCK_LEN);
139 * Fill input block with len_pad char.
141 memset(block, len_pad, len_pad);
145 static void md2_compute(void *_state, void *_checksum, void *_block)
149 uint8_t compute_array[COMPUTE_ARRAY_LEN];
154 state = (uint8_t *)_state;
155 checksum = (uint8_t *)_checksum;
156 block = (uint8_t *)_block;
159 * Copy state and checksum context in compute array.
161 memcpy(compute_array, state, CONFIG_MD2_BLOCK_LEN);
162 memcpy(compute_array + CONFIG_MD2_BLOCK_LEN, block, CONFIG_MD2_BLOCK_LEN);
165 * Fill compute array with state XOR block
167 for(i = 0; i < CONFIG_MD2_BLOCK_LEN; i++)
168 compute_array[i + (CONFIG_MD2_BLOCK_LEN * 2)] = state[i] ^ block[i];
173 for(i = 0; i < NUM_COMPUTE_ROUNDS; i++)
175 for(int j = 0; j < COMPUTE_ARRAY_LEN; j++)
177 compute_array[j] ^= MD2_PERM(t);
178 t = compute_array[j];
181 t = (t + i) & 0xff; //modulo 256.
186 t = checksum[CONFIG_MD2_BLOCK_LEN - 1];
188 for(i = 0; i < CONFIG_MD2_BLOCK_LEN; i++)
190 checksum[i] ^= MD2_PERM(block[i] ^ t);
195 * Update state and clean compute array.
197 memcpy(state, compute_array, CONFIG_MD2_BLOCK_LEN);
198 memset(compute_array, 0, sizeof(compute_array));
202 * Algorithm initialization.
204 * \param empty context.
206 void md2_init(Md2Context *context)
209 memset(context, 0, sizeof(Md2Context));
216 void md2_update(Md2Context *context, const void *_block_in, size_t block_len)
219 const uint8_t *block_in;
223 block_in = (const uint8_t *)_block_in;
228 * Choose a number of block that fill input context buffer.
230 cpy_len = MIN(block_len, CONFIG_MD2_BLOCK_LEN - context->counter);
234 * Copy in the buffer input block.
236 memcpy(&context->buffer[context->counter], block_in, cpy_len);
239 * Update a context counter, input block length and remaning
240 * context buffer block lenght.
242 context->counter += cpy_len;
243 block_len -= cpy_len;
247 * If buffer is full, compute it.
249 if (context->counter >= CONFIG_MD2_BLOCK_LEN)
251 md2_compute(context->state, context->checksum, context->buffer);
252 context->counter = 0;
259 * Ends an MD2 message digest operation.
260 * This fuction take an context and return a pointer
263 * \param context in input.
264 * \return a pointer to context state (message digest).
266 uint8_t *md2_end(Md2Context *context)
269 uint8_t buf[CONFIG_MD2_BLOCK_LEN];
272 * Fill remaning empty context buffer.
274 md2_pad(buf, CONFIG_MD2_BLOCK_LEN - context->counter);
277 * Update context buffer and compute it.
279 md2_update(context, buf, CONFIG_MD2_BLOCK_LEN - context->counter);
282 * Add context checksum to message input.
284 md2_update(context, context->checksum, CONFIG_MD2_BLOCK_LEN);
287 return context->state; //return a pointer to message digest.
291 * This function test MD2 algorithm with a standard string specified
294 * \note This test work with official array of 256 byte pemutation
295 * contructed from digits of pi, defined in the RFC 1319.
307 "abcdefghijklmnopqrstuvwxyz",
308 "12345678901234567890123456789012345678901234567890123456789012345678901234567890"
312 const uint8_t *result[] = {
313 "\x83\x50\xe5\xa3\xe2\x4c\x15\x3d\xf2\x27\x5c\x9f\x80\x69\x27\x73",
314 "\xab\x4f\x49\x6b\xfb\x2a\x53\x0b\x21\x9f\xf3\x30\x31\xfe\x06\xb0",
315 "\x4e\x8d\xdf\xf3\x65\x02\x92\xab\x5a\x41\x08\xc3\xaa\x47\x94\x0b",
316 "\xd5\x97\x6f\x79\xd8\x3d\x3a\x0d\xc9\x80\x6c\x3c\x66\xf3\xef\xd8",
320 for (int i = 0; i < countof(test); i++)
323 md2_update(&context, test[i], strlen(test[i]));
325 if(memcmp(result[i], md2_end(&context), CONFIG_MD2_BLOCK_LEN))
335 int main(int argc, char * argv[])
339 printf("MD2 algorithm work well!\n");
341 printf("MD2 algorithm doesn't work well.\n");