cannam@167: /* cannam@167: * Copyright (c) 2003, 2007-14 Matteo Frigo cannam@167: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology cannam@167: * cannam@167: * This program is free software; you can redistribute it and/or modify cannam@167: * it under the terms of the GNU General Public License as published by cannam@167: * the Free Software Foundation; either version 2 of the License, or cannam@167: * (at your option) any later version. cannam@167: * cannam@167: * This program is distributed in the hope that it will be useful, cannam@167: * but WITHOUT ANY WARRANTY; without even the implied warranty of cannam@167: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the cannam@167: * GNU General Public License for more details. cannam@167: * cannam@167: * You should have received a copy of the GNU General Public License cannam@167: * along with this program; if not, write to the Free Software cannam@167: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA cannam@167: * cannam@167: */ cannam@167: cannam@167: /* cannam@167: independent implementation of Ron Rivest's MD5 message-digest cannam@167: algorithm, based on rfc 1321. cannam@167: cannam@167: Optimized for small code size, not speed. Works as long as cannam@167: sizeof(md5uint) >= 4. cannam@167: */ cannam@167: cannam@167: #include "kernel/ifftw.h" cannam@167: cannam@167: /* sintab[i] = 4294967296.0 * abs(sin((double)(i + 1))) */ cannam@167: static const md5uint sintab[64] = { cannam@167: 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, cannam@167: 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501, cannam@167: 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, cannam@167: 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821, cannam@167: 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, cannam@167: 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8, cannam@167: 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, cannam@167: 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a, cannam@167: 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, cannam@167: 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, cannam@167: 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, cannam@167: 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665, cannam@167: 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, cannam@167: 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1, cannam@167: 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, cannam@167: 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391 cannam@167: }; cannam@167: cannam@167: /* see rfc 1321 section 3.4 */ cannam@167: static const struct roundtab { cannam@167: char k; cannam@167: char s; cannam@167: } roundtab[64] = { cannam@167: { 0, 7}, { 1, 12}, { 2, 17}, { 3, 22}, cannam@167: { 4, 7}, { 5, 12}, { 6, 17}, { 7, 22}, cannam@167: { 8, 7}, { 9, 12}, { 10, 17}, { 11, 22}, cannam@167: { 12, 7}, { 13, 12}, { 14, 17}, { 15, 22}, cannam@167: { 1, 5}, { 6, 9}, { 11, 14}, { 0, 20}, cannam@167: { 5, 5}, { 10, 9}, { 15, 14}, { 4, 20}, cannam@167: { 9, 5}, { 14, 9}, { 3, 14}, { 8, 20}, cannam@167: { 13, 5}, { 2, 9}, { 7, 14}, { 12, 20}, cannam@167: { 5, 4}, { 8, 11}, { 11, 16}, { 14, 23}, cannam@167: { 1, 4}, { 4, 11}, { 7, 16}, { 10, 23}, cannam@167: { 13, 4}, { 0, 11}, { 3, 16}, { 6, 23}, cannam@167: { 9, 4}, { 12, 11}, { 15, 16}, { 2, 23}, cannam@167: { 0, 6}, { 7, 10}, { 14, 15}, { 5, 21}, cannam@167: { 12, 6}, { 3, 10}, { 10, 15}, { 1, 21}, cannam@167: { 8, 6}, { 15, 10}, { 6, 15}, { 13, 21}, cannam@167: { 4, 6}, { 11, 10}, { 2, 15}, { 9, 21} cannam@167: }; cannam@167: cannam@167: #define rol(a, s) ((a << (int)(s)) | (a >> (32 - (int)(s)))) cannam@167: cannam@167: static void doblock(md5sig state, const unsigned char *data) cannam@167: { cannam@167: md5uint a, b, c, d, t, x[16]; cannam@167: const md5uint msk = (md5uint)0xffffffffUL; cannam@167: int i; cannam@167: cannam@167: /* encode input bytes into md5uint */ cannam@167: for (i = 0; i < 16; ++i) { cannam@167: const unsigned char *p = data + 4 * i; cannam@167: x[i] = (unsigned)p[0] | ((unsigned)p[1] << 8) | ((unsigned)p[2] << 16) | ((unsigned)p[3] << 24); cannam@167: } cannam@167: cannam@167: a = state[0]; b = state[1]; c = state[2]; d = state[3]; cannam@167: for (i = 0; i < 64; ++i) { cannam@167: const struct roundtab *p = roundtab + i; cannam@167: switch (i >> 4) { cannam@167: case 0: a += (b & c) | (~b & d); break; cannam@167: case 1: a += (b & d) | (c & ~d); break; cannam@167: case 2: a += b ^ c ^ d; break; cannam@167: case 3: a += c ^ (b | ~d); break; cannam@167: } cannam@167: a += sintab[i]; cannam@167: a += x[(int)(p->k)]; cannam@167: a &= msk; cannam@167: t = b + rol(a, p->s); cannam@167: a = d; d = c; c = b; b = t; cannam@167: } cannam@167: state[0] = (state[0] + a) & msk; cannam@167: state[1] = (state[1] + b) & msk; cannam@167: state[2] = (state[2] + c) & msk; cannam@167: state[3] = (state[3] + d) & msk; cannam@167: } cannam@167: cannam@167: cannam@167: void X(md5begin)(md5 *p) cannam@167: { cannam@167: p->s[0] = 0x67452301; cannam@167: p->s[1] = 0xefcdab89; cannam@167: p->s[2] = 0x98badcfe; cannam@167: p->s[3] = 0x10325476; cannam@167: p->l = 0; cannam@167: } cannam@167: cannam@167: void X(md5putc)(md5 *p, unsigned char c) cannam@167: { cannam@167: p->c[p->l % 64] = c; cannam@167: if (((++p->l) % 64) == 0) doblock(p->s, p->c); cannam@167: } cannam@167: cannam@167: void X(md5end)(md5 *p) cannam@167: { cannam@167: unsigned l, i; cannam@167: cannam@167: l = 8 * p->l; /* length before padding, in bits */ cannam@167: cannam@167: /* rfc 1321 section 3.1: padding */ cannam@167: X(md5putc)(p, 0x80); cannam@167: while ((p->l % 64) != 56) X(md5putc)(p, 0x00); cannam@167: cannam@167: /* rfc 1321 section 3.2: length (little endian) */ cannam@167: for (i = 0; i < 8; ++i) { cannam@167: X(md5putc)(p, (unsigned char)(l & 0xFF)); cannam@167: l = l >> 8; cannam@167: } cannam@167: cannam@167: /* Now p->l % 64 == 0 and signature is in p->s */ cannam@167: }