1 /* MD2 (RFC 1319) hash function implementation by Tom St Denis */
6 const struct _hash_descriptor md2_desc =
18 static const unsigned char PI_SUBST[256] = {
19 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,
20 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,
21 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,
22 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,
23 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,
24 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,
25 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,
26 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,
27 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,
28 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,
29 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,
30 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,
31 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,
32 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,
33 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,
34 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,
35 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,
36 31, 26, 219, 153, 141, 51, 159, 17, 131, 20
39 /* adds 16 bytes to the checksum */
40 static void md2_update_chksum(hash_state *md)
44 L = md->md2.chksum[15];
45 for (j = 0; j < 16; j++) {
47 /* caution, the RFC says its "C[j] = S[M[i*16+j] xor L]" but the reference source code [and test vectors] say
50 L = (md->md2.chksum[j] ^= PI_SUBST[(int)(md->md2.buf[j] ^ L)]);
54 static void md2_compress(hash_state *md)
60 for (j = 0; j < 16; j++) {
61 md->md2.X[16+j] = md->md2.buf[j];
62 md->md2.X[32+j] = md->md2.X[j] ^ md->md2.X[16+j];
68 for (j = 0; j < 18; j++) {
69 for (k = 0; k < 48; k++) {
70 t = (md->md2.X[k] ^= PI_SUBST[(int)t]);
72 t = (t + (unsigned char)j) & 255;
76 void md2_init(hash_state *md)
80 /* MD2 uses a zero'ed state... */
81 zeromem(md->md2.X, sizeof(md->md2.X));
82 zeromem(md->md2.chksum, sizeof(md->md2.chksum));
83 zeromem(md->md2.buf, sizeof(md->md2.buf));
87 void md2_process(hash_state *md, const unsigned char *buf, unsigned long len)
93 n = MIN(len, (16 - md->md2.curlen));
94 memcpy(md->md2.buf + md->md2.curlen, buf, (size_t)n);
99 /* is 16 bytes full? */
100 if (md->md2.curlen == 16) {
102 md2_update_chksum(md);
108 void md2_done(hash_state * md, unsigned char *hash)
113 _ARGCHK(hash != NULL);
115 /* pad the message */
116 k = 16 - md->md2.curlen;
117 for (i = md->md2.curlen; i < 16; i++) {
118 md->md2.buf[i] = (unsigned char)k;
121 /* hash and update */
123 md2_update_chksum(md);
126 memcpy(md->md2.buf, md->md2.chksum, 16);
129 /* output is lower 16 bytes of X */
130 memcpy(hash, md->md2.X, 16);
133 zeromem(md, sizeof(hash_state));
142 static const struct {
144 unsigned char md[16];
147 {0x83,0x50,0xe5,0xa3,0xe2,0x4c,0x15,0x3d,
148 0xf2,0x27,0x5c,0x9f,0x80,0x69,0x27,0x73
152 {0x32,0xec,0x01,0xec,0x4a,0x6d,0xac,0x72,
153 0xc0,0xab,0x96,0xfb,0x34,0xc0,0xb5,0xd1
157 {0xab,0x4f,0x49,0x6b,0xfb,0x2a,0x53,0x0b,
158 0x21,0x9f,0xf3,0x30,0x31,0xfe,0x06,0xb0
161 { "abcdefghijklmnopqrstuvwxyz",
162 {0x4e,0x8d,0xdf,0xf3,0x65,0x02,0x92,0xab,
163 0x5a,0x41,0x08,0xc3,0xaa,0x47,0x94,0x0b
166 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
167 {0xda,0x33,0xde,0xf2,0xa4,0x2d,0xf1,0x39,
168 0x75,0x35,0x28,0x46,0xc3,0x03,0x38,0xcd
171 { "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
172 {0xd5,0x97,0x6f,0x79,0xd8,0x3d,0x3a,0x0d,
173 0xc9,0x80,0x6c,0x3c,0x66,0xf3,0xef,0xd8
179 unsigned char buf[16];
181 for (i = 0; i < (int)(sizeof(tests) / sizeof(tests[0])); i++) {
183 md2_process(&md, (unsigned char*)tests[i].msg, (unsigned long)strlen(tests[i].msg));
185 if (memcmp(buf, tests[i].md, 16) != 0) {
186 return CRYPT_FAIL_TESTVECTOR;