master xplshn/aruu / shared / libutil / md5.c
  1/* public domain md5 implementation based on rfc1321 and libtomcrypt */
  2#include <stdint.h>
  3#include <string.h>
  4
  5#include "../md5.h"
  6
  7static uint32_t
  8rol(uint32_t n, int k)
  9{
 10  return (n << k) | (n >> (32 - k));
 11}
 12#define F(x, y, z) (z ^ (x & (y ^ z)))
 13#define G(x, y, z) (y ^ (z & (y ^ x)))
 14#define H(x, y, z) (x ^ y ^ z)
 15#define I(x, y, z) (y ^ (x | ~z))
 16#define FF(a, b, c, d, w, s, t)                                                                    \
 17  a += F(b, c, d) + w + t;                                                                         \
 18  a = rol(a, s) + b
 19#define GG(a, b, c, d, w, s, t)                                                                    \
 20  a += G(b, c, d) + w + t;                                                                         \
 21  a = rol(a, s) + b
 22#define HH(a, b, c, d, w, s, t)                                                                    \
 23  a += H(b, c, d) + w + t;                                                                         \
 24  a = rol(a, s) + b
 25#define II(a, b, c, d, w, s, t)                                                                    \
 26  a += I(b, c, d) + w + t;                                                                         \
 27  a = rol(a, s) + b
 28
 29static const uint32_t tab[64] = {
 30    0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
 31    0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
 32    0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
 33    0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
 34    0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
 35    0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
 36    0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
 37    0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
 38};
 39
 40static void
 41processblock(struct md5 *s, const uint8_t *buf)
 42{
 43  uint32_t i, W[16], a, b, c, d;
 44
 45  for (i = 0; i < 16; i++) {
 46    W[i] = buf[4 * i];
 47    W[i] |= (uint32_t)buf[4 * i + 1] << 8;
 48    W[i] |= (uint32_t)buf[4 * i + 2] << 16;
 49    W[i] |= (uint32_t)buf[4 * i + 3] << 24;
 50  }
 51
 52  a = s->h[0];
 53  b = s->h[1];
 54  c = s->h[2];
 55  d = s->h[3];
 56
 57  i = 0;
 58  while (i < 16) {
 59    FF(a, b, c, d, W[i], 7, tab[i]);
 60    i++;
 61    FF(d, a, b, c, W[i], 12, tab[i]);
 62    i++;
 63    FF(c, d, a, b, W[i], 17, tab[i]);
 64    i++;
 65    FF(b, c, d, a, W[i], 22, tab[i]);
 66    i++;
 67  }
 68  while (i < 32) {
 69    GG(a, b, c, d, W[(5 * i + 1) % 16], 5, tab[i]);
 70    i++;
 71    GG(d, a, b, c, W[(5 * i + 1) % 16], 9, tab[i]);
 72    i++;
 73    GG(c, d, a, b, W[(5 * i + 1) % 16], 14, tab[i]);
 74    i++;
 75    GG(b, c, d, a, W[(5 * i + 1) % 16], 20, tab[i]);
 76    i++;
 77  }
 78  while (i < 48) {
 79    HH(a, b, c, d, W[(3 * i + 5) % 16], 4, tab[i]);
 80    i++;
 81    HH(d, a, b, c, W[(3 * i + 5) % 16], 11, tab[i]);
 82    i++;
 83    HH(c, d, a, b, W[(3 * i + 5) % 16], 16, tab[i]);
 84    i++;
 85    HH(b, c, d, a, W[(3 * i + 5) % 16], 23, tab[i]);
 86    i++;
 87  }
 88  while (i < 64) {
 89    II(a, b, c, d, W[7 * i % 16], 6, tab[i]);
 90    i++;
 91    II(d, a, b, c, W[7 * i % 16], 10, tab[i]);
 92    i++;
 93    II(c, d, a, b, W[7 * i % 16], 15, tab[i]);
 94    i++;
 95    II(b, c, d, a, W[7 * i % 16], 21, tab[i]);
 96    i++;
 97  }
 98
 99  s->h[0] += a;
100  s->h[1] += b;
101  s->h[2] += c;
102  s->h[3] += d;
103}
104
105static void
106pad(struct md5 *s)
107{
108  unsigned r = s->len % 64;
109
110  s->buf[r++] = 0x80;
111  if (r > 56) {
112    memset(s->buf + r, 0, 64 - r);
113    r = 0;
114    processblock(s, s->buf);
115  }
116  memset(s->buf + r, 0, 56 - r);
117  s->len *= 8;
118  s->buf[56] = s->len;
119  s->buf[57] = s->len >> 8;
120  s->buf[58] = s->len >> 16;
121  s->buf[59] = s->len >> 24;
122  s->buf[60] = s->len >> 32;
123  s->buf[61] = s->len >> 40;
124  s->buf[62] = s->len >> 48;
125  s->buf[63] = s->len >> 56;
126  processblock(s, s->buf);
127}
128
129void
130md5_init(void *ctx)
131{
132  struct md5 *s = ctx;
133  s->len        = 0;
134  s->h[0]       = 0x67452301;
135  s->h[1]       = 0xefcdab89;
136  s->h[2]       = 0x98badcfe;
137  s->h[3]       = 0x10325476;
138}
139
140void
141md5_sum(void *ctx, uint8_t md[MD5_DIGEST_LENGTH])
142{
143  struct md5 *s = ctx;
144  int         i;
145
146  pad(s);
147  for (i = 0; i < 4; i++) {
148    md[4 * i]     = s->h[i];
149    md[4 * i + 1] = s->h[i] >> 8;
150    md[4 * i + 2] = s->h[i] >> 16;
151    md[4 * i + 3] = s->h[i] >> 24;
152  }
153}
154
155void
156md5_update(void *ctx, const void *m, unsigned long len)
157{
158  struct md5    *s = ctx;
159  const uint8_t *p = m;
160  unsigned       r = s->len % 64;
161
162  s->len += len;
163  if (r) {
164    if (len < 64 - r) {
165      memcpy(s->buf + r, p, len);
166      return;
167    }
168    memcpy(s->buf + r, p, 64 - r);
169    len -= 64 - r;
170    p += 64 - r;
171    processblock(s, s->buf);
172  }
173  for (; len >= 64; len -= 64, p += 64)
174    processblock(s, p);
175  memcpy(s->buf, p, len);
176}