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