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