OLD | NEW |
1 /* | 1 /* |
2 * This code implements the MD5 message-digest algorithm. | 2 * This code implements the MD5 message-digest algorithm. |
3 * The algorithm is due to Ron Rivest. This code was | 3 * The algorithm is due to Ron Rivest. This code was |
4 * written by Colin Plumb in 1993, no copyright is claimed. | 4 * written by Colin Plumb in 1993, no copyright is claimed. |
5 * This code is in the public domain; do with it what you wish. | 5 * This code is in the public domain; do with it what you wish. |
6 * | 6 * |
7 * Equivalent code is available from RSA Data Security, Inc. | 7 * Equivalent code is available from RSA Data Security, Inc. |
8 * This code has been tested against that, and is equivalent, | 8 * This code has been tested against that, and is equivalent, |
9 * except that you don't need to include two pages of legalese | 9 * except that you don't need to include two pages of legalese |
10 * with every copy. | 10 * with every copy. |
(...skipping 202 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
213 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); | 213 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); |
214 MD5STEP(F4, c, d, a, b, in[ 2] + 0x2ad7d2bb, 15); | 214 MD5STEP(F4, c, d, a, b, in[ 2] + 0x2ad7d2bb, 15); |
215 MD5STEP(F4, b, c, d, a, in[ 9] + 0xeb86d391, 21); | 215 MD5STEP(F4, b, c, d, a, in[ 9] + 0xeb86d391, 21); |
216 buf[0] += a; | 216 buf[0] += a; |
217 buf[1] += b; | 217 buf[1] += b; |
218 buf[2] += c; | 218 buf[2] += c; |
219 buf[3] += d; | 219 buf[3] += d; |
220 } | 220 } |
221 | 221 |
222 } // namespace rtc | 222 } // namespace rtc |
OLD | NEW |