1 /* 1 /*
2 * Cryptographic API. 2 * Cryptographic API.
3 * 3 *
4 * MD5 Message Digest Algorithm (RFC1321). 4 * MD5 Message Digest Algorithm (RFC1321).
5 * 5 *
6 * Derived from cryptoapi implementation, orig 6 * Derived from cryptoapi implementation, originally based on the
7 * public domain implementation written by Col 7 * public domain implementation written by Colin Plumb in 1993.
8 * 8 *
9 * Copyright (c) Cryptoapi developers. 9 * Copyright (c) Cryptoapi developers.
10 * Copyright (c) 2002 James Morris <jmorris@in 10 * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
11 * 11 *
12 * This program is free software; you can redi 12 * This program is free software; you can redistribute it and/or modify it
13 * under the terms of the GNU General Public L 13 * under the terms of the GNU General Public License as published by the Free
14 * Software Foundation; either version 2 of th 14 * Software Foundation; either version 2 of the License, or (at your option)
15 * any later version. 15 * any later version.
16 * 16 *
17 */ 17 */
18 #include <crypto/internal/hash.h> 18 #include <crypto/internal/hash.h>
19 #include <crypto/md5.h> 19 #include <crypto/md5.h>
20 #include <linux/init.h> 20 #include <linux/init.h>
21 #include <linux/module.h> 21 #include <linux/module.h>
22 #include <linux/string.h> 22 #include <linux/string.h>
23 #include <linux/types.h> 23 #include <linux/types.h>
>> 24 #include <linux/cryptohash.h>
24 #include <asm/byteorder.h> 25 #include <asm/byteorder.h>
25 26
26 const u8 md5_zero_message_hash[MD5_DIGEST_SIZE !! 27 /* XXX: this stuff can be optimized */
27 0xd4, 0x1d, 0x8c, 0xd9, 0x8f, 0x00, 0x !! 28 static inline void le32_to_cpu_array(u32 *buf, unsigned int words)
28 0xe9, 0x80, 0x09, 0x98, 0xec, 0xf8, 0x !! 29 {
29 }; !! 30 while (words--) {
30 EXPORT_SYMBOL_GPL(md5_zero_message_hash); !! 31 __le32_to_cpus(buf);
>> 32 buf++;
>> 33 }
>> 34 }
31 35
32 #define F1(x, y, z) (z ^ (x & (y ^ z))) !! 36 static inline void cpu_to_le32_array(u32 *buf, unsigned int words)
33 #define F2(x, y, z) F1(z, x, y) !! 37 {
34 #define F3(x, y, z) (x ^ y ^ z) !! 38 while (words--) {
35 #define F4(x, y, z) (y ^ (x | ~z)) !! 39 __cpu_to_le32s(buf);
36 !! 40 buf++;
37 #define MD5STEP(f, w, x, y, z, in, s) \ !! 41 }
38 (w += f(x, y, z) + in, w = (w<<s | w>> <<
39 <<
40 static void md5_transform(__u32 *hash, __u32 c <<
41 { <<
42 u32 a, b, c, d; <<
43 <<
44 a = hash[0]; <<
45 b = hash[1]; <<
46 c = hash[2]; <<
47 d = hash[3]; <<
48 <<
49 MD5STEP(F1, a, b, c, d, in[0] + 0xd76a <<
50 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7 <<
51 MD5STEP(F1, c, d, a, b, in[2] + 0x2420 <<
52 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bd <<
53 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c <<
54 MD5STEP(F1, d, a, b, c, in[5] + 0x4787 <<
55 MD5STEP(F1, c, d, a, b, in[6] + 0xa830 <<
56 MD5STEP(F1, b, c, d, a, in[7] + 0xfd46 <<
57 MD5STEP(F1, a, b, c, d, in[8] + 0x6980 <<
58 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44 <<
59 MD5STEP(F1, c, d, a, b, in[10] + 0xfff <<
60 MD5STEP(F1, b, c, d, a, in[11] + 0x895 <<
61 MD5STEP(F1, a, b, c, d, in[12] + 0x6b9 <<
62 MD5STEP(F1, d, a, b, c, in[13] + 0xfd9 <<
63 MD5STEP(F1, c, d, a, b, in[14] + 0xa67 <<
64 MD5STEP(F1, b, c, d, a, in[15] + 0x49b <<
65 <<
66 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e <<
67 MD5STEP(F2, d, a, b, c, in[6] + 0xc040 <<
68 MD5STEP(F2, c, d, a, b, in[11] + 0x265 <<
69 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6 <<
70 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f <<
71 MD5STEP(F2, d, a, b, c, in[10] + 0x024 <<
72 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a <<
73 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3 <<
74 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1 <<
75 MD5STEP(F2, d, a, b, c, in[14] + 0xc33 <<
76 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d5 <<
77 MD5STEP(F2, b, c, d, a, in[8] + 0x455a <<
78 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e <<
79 MD5STEP(F2, d, a, b, c, in[2] + 0xfcef <<
80 MD5STEP(F2, c, d, a, b, in[7] + 0x676f <<
81 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2 <<
82 <<
83 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa <<
84 MD5STEP(F3, d, a, b, c, in[8] + 0x8771 <<
85 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9 <<
86 MD5STEP(F3, b, c, d, a, in[14] + 0xfde <<
87 MD5STEP(F3, a, b, c, d, in[1] + 0xa4be <<
88 MD5STEP(F3, d, a, b, c, in[4] + 0x4bde <<
89 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb <<
90 MD5STEP(F3, b, c, d, a, in[10] + 0xbeb <<
91 MD5STEP(F3, a, b, c, d, in[13] + 0x289 <<
92 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa1 <<
93 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef <<
94 MD5STEP(F3, b, c, d, a, in[6] + 0x0488 <<
95 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4 <<
96 MD5STEP(F3, d, a, b, c, in[12] + 0xe6d <<
97 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa <<
98 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac <<
99 <<
100 MD5STEP(F4, a, b, c, d, in[0] + 0xf429 <<
101 MD5STEP(F4, d, a, b, c, in[7] + 0x432a <<
102 MD5STEP(F4, c, d, a, b, in[14] + 0xab9 <<
103 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93 <<
104 MD5STEP(F4, a, b, c, d, in[12] + 0x655 <<
105 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0c <<
106 MD5STEP(F4, c, d, a, b, in[10] + 0xffe <<
107 MD5STEP(F4, b, c, d, a, in[1] + 0x8584 <<
108 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa8 <<
109 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2 <<
110 MD5STEP(F4, c, d, a, b, in[6] + 0xa301 <<
111 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0 <<
112 MD5STEP(F4, a, b, c, d, in[4] + 0xf753 <<
113 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3 <<
114 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7 <<
115 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86 <<
116 <<
117 hash[0] += a; <<
118 hash[1] += b; <<
119 hash[2] += c; <<
120 hash[3] += d; <<
121 } 42 }
122 43
123 static inline void md5_transform_helper(struct 44 static inline void md5_transform_helper(struct md5_state *ctx)
124 { 45 {
125 le32_to_cpu_array(ctx->block, sizeof(c 46 le32_to_cpu_array(ctx->block, sizeof(ctx->block) / sizeof(u32));
126 md5_transform(ctx->hash, ctx->block); 47 md5_transform(ctx->hash, ctx->block);
127 } 48 }
128 49
129 static int md5_init(struct shash_desc *desc) 50 static int md5_init(struct shash_desc *desc)
130 { 51 {
131 struct md5_state *mctx = shash_desc_ct 52 struct md5_state *mctx = shash_desc_ctx(desc);
132 53
133 mctx->hash[0] = MD5_H0; !! 54 mctx->hash[0] = 0x67452301;
134 mctx->hash[1] = MD5_H1; !! 55 mctx->hash[1] = 0xefcdab89;
135 mctx->hash[2] = MD5_H2; !! 56 mctx->hash[2] = 0x98badcfe;
136 mctx->hash[3] = MD5_H3; !! 57 mctx->hash[3] = 0x10325476;
137 mctx->byte_count = 0; 58 mctx->byte_count = 0;
138 59
139 return 0; 60 return 0;
140 } 61 }
141 62
142 static int md5_update(struct shash_desc *desc, 63 static int md5_update(struct shash_desc *desc, const u8 *data, unsigned int len)
143 { 64 {
144 struct md5_state *mctx = shash_desc_ct 65 struct md5_state *mctx = shash_desc_ctx(desc);
145 const u32 avail = sizeof(mctx->block) 66 const u32 avail = sizeof(mctx->block) - (mctx->byte_count & 0x3f);
146 67
147 mctx->byte_count += len; 68 mctx->byte_count += len;
148 69
149 if (avail > len) { 70 if (avail > len) {
150 memcpy((char *)mctx->block + ( 71 memcpy((char *)mctx->block + (sizeof(mctx->block) - avail),
151 data, len); 72 data, len);
152 return 0; 73 return 0;
153 } 74 }
154 75
155 memcpy((char *)mctx->block + (sizeof(m 76 memcpy((char *)mctx->block + (sizeof(mctx->block) - avail),
156 data, avail); 77 data, avail);
157 78
158 md5_transform_helper(mctx); 79 md5_transform_helper(mctx);
159 data += avail; 80 data += avail;
160 len -= avail; 81 len -= avail;
161 82
162 while (len >= sizeof(mctx->block)) { 83 while (len >= sizeof(mctx->block)) {
163 memcpy(mctx->block, data, size 84 memcpy(mctx->block, data, sizeof(mctx->block));
164 md5_transform_helper(mctx); 85 md5_transform_helper(mctx);
165 data += sizeof(mctx->block); 86 data += sizeof(mctx->block);
166 len -= sizeof(mctx->block); 87 len -= sizeof(mctx->block);
167 } 88 }
168 89
169 memcpy(mctx->block, data, len); 90 memcpy(mctx->block, data, len);
170 91
171 return 0; 92 return 0;
172 } 93 }
173 94
174 static int md5_final(struct shash_desc *desc, 95 static int md5_final(struct shash_desc *desc, u8 *out)
175 { 96 {
176 struct md5_state *mctx = shash_desc_ct 97 struct md5_state *mctx = shash_desc_ctx(desc);
177 const unsigned int offset = mctx->byte 98 const unsigned int offset = mctx->byte_count & 0x3f;
178 char *p = (char *)mctx->block + offset 99 char *p = (char *)mctx->block + offset;
179 int padding = 56 - (offset + 1); 100 int padding = 56 - (offset + 1);
180 101
181 *p++ = 0x80; 102 *p++ = 0x80;
182 if (padding < 0) { 103 if (padding < 0) {
183 memset(p, 0x00, padding + size 104 memset(p, 0x00, padding + sizeof (u64));
184 md5_transform_helper(mctx); 105 md5_transform_helper(mctx);
185 p = (char *)mctx->block; 106 p = (char *)mctx->block;
186 padding = 56; 107 padding = 56;
187 } 108 }
188 109
189 memset(p, 0, padding); 110 memset(p, 0, padding);
190 mctx->block[14] = mctx->byte_count << 111 mctx->block[14] = mctx->byte_count << 3;
191 mctx->block[15] = mctx->byte_count >> 112 mctx->block[15] = mctx->byte_count >> 29;
192 le32_to_cpu_array(mctx->block, (sizeof 113 le32_to_cpu_array(mctx->block, (sizeof(mctx->block) -
193 sizeof(u64)) / sizeo 114 sizeof(u64)) / sizeof(u32));
194 md5_transform(mctx->hash, mctx->block) 115 md5_transform(mctx->hash, mctx->block);
195 cpu_to_le32_array(mctx->hash, sizeof(m 116 cpu_to_le32_array(mctx->hash, sizeof(mctx->hash) / sizeof(u32));
196 memcpy(out, mctx->hash, sizeof(mctx->h 117 memcpy(out, mctx->hash, sizeof(mctx->hash));
197 memset(mctx, 0, sizeof(*mctx)); 118 memset(mctx, 0, sizeof(*mctx));
198 119
199 return 0; 120 return 0;
200 } 121 }
201 122
202 static int md5_export(struct shash_desc *desc, 123 static int md5_export(struct shash_desc *desc, void *out)
203 { 124 {
204 struct md5_state *ctx = shash_desc_ctx 125 struct md5_state *ctx = shash_desc_ctx(desc);
205 126
206 memcpy(out, ctx, sizeof(*ctx)); 127 memcpy(out, ctx, sizeof(*ctx));
207 return 0; 128 return 0;
208 } 129 }
209 130
210 static int md5_import(struct shash_desc *desc, 131 static int md5_import(struct shash_desc *desc, const void *in)
211 { 132 {
212 struct md5_state *ctx = shash_desc_ctx 133 struct md5_state *ctx = shash_desc_ctx(desc);
213 134
214 memcpy(ctx, in, sizeof(*ctx)); 135 memcpy(ctx, in, sizeof(*ctx));
215 return 0; 136 return 0;
216 } 137 }
217 138
218 static struct shash_alg alg = { 139 static struct shash_alg alg = {
219 .digestsize = MD5_DIGEST_SIZ 140 .digestsize = MD5_DIGEST_SIZE,
220 .init = md5_init, 141 .init = md5_init,
221 .update = md5_update, 142 .update = md5_update,
222 .final = md5_final, 143 .final = md5_final,
223 .export = md5_export, 144 .export = md5_export,
224 .import = md5_import, 145 .import = md5_import,
225 .descsize = sizeof(struct 146 .descsize = sizeof(struct md5_state),
226 .statesize = sizeof(struct 147 .statesize = sizeof(struct md5_state),
227 .base = { 148 .base = {
228 .cra_name = "md5", !! 149 .cra_name = "md5",
229 .cra_driver_name = "md5-g !! 150 .cra_flags = CRYPTO_ALG_TYPE_SHASH,
230 .cra_blocksize = MD5_HM !! 151 .cra_blocksize = MD5_HMAC_BLOCK_SIZE,
231 .cra_module = THIS_M !! 152 .cra_module = THIS_MODULE,
232 } 153 }
233 }; 154 };
234 155
235 static int __init md5_mod_init(void) 156 static int __init md5_mod_init(void)
236 { 157 {
237 return crypto_register_shash(&alg); 158 return crypto_register_shash(&alg);
238 } 159 }
239 160
240 static void __exit md5_mod_fini(void) 161 static void __exit md5_mod_fini(void)
241 { 162 {
242 crypto_unregister_shash(&alg); 163 crypto_unregister_shash(&alg);
243 } 164 }
244 165
245 subsys_initcall(md5_mod_init); !! 166 module_init(md5_mod_init);
246 module_exit(md5_mod_fini); 167 module_exit(md5_mod_fini);
247 168
248 MODULE_LICENSE("GPL"); 169 MODULE_LICENSE("GPL");
249 MODULE_DESCRIPTION("MD5 Message Digest Algorit 170 MODULE_DESCRIPTION("MD5 Message Digest Algorithm");
250 MODULE_ALIAS_CRYPTO("md5"); 171 MODULE_ALIAS_CRYPTO("md5");
251 172
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.