* md2.c, md2.h, md2-meta.c: New files, implemented md2.

* md4.c, md4.h, md4-meta.c: New files, implemented md4.

Rev: src/nettle/md2-meta.c:1.1
Rev: src/nettle/md2.c:1.1
Rev: src/nettle/md2.h:1.1
Rev: src/nettle/md4-meta.c:1.1
Rev: src/nettle/md4.c:1.1
Rev: src/nettle/md4.h:1.1

1 files changed, 271 insertions, 0 deletions

diff --git a/md4.c b/md4.c
new file mode 100644
index 00000000..6bd178e7
--- /dev/null
+++ b/md4.c
@@ -0,0 +1,271 @@
+/* md4.h
+ *
+ * The MD4 hash function. XXX What RFC, if any?
+ */
+
+/* nettle, low-level cryptographics library
+ *
+ * Copyright (C) 2003 Niels Möller
+ *  
+ * The nettle library is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at your
+ * option) any later version.
+ * 
+ * The nettle library is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
+ * License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with the nettle library; see the file COPYING.LIB.  If not, write to
+ * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
+ * MA 02111-1307, USA.
+ */
+
+/* Adapted from md5 code by Marcus Comstedt */
+
+#if HAVE_CONFIG_H
+# include "config.h"
+#endif
+
+#include <assert.h>
+#include <string.h>
+
+#include "md4.h"
+
+#include "macros.h"
+
+/* A block, treated as a sequence of 32-bit words. */
+#define MD4_DATA_LENGTH 16
+
+static void
+md4_transform(uint32_t *digest, const uint32_t *data);
+
+static void
+md4_block(struct md4_ctx *ctx, const uint8_t *block);
+
+static void
+md4_final(struct md4_ctx *ctx);
+
+void
+md4_init(struct md4_ctx *ctx)
+{
+  /* Same constants as for md5. */
+  ctx->digest[0] = 0x67452301;
+  ctx->digest[1] = 0xefcdab89;
+  ctx->digest[2] = 0x98badcfe;
+  ctx->digest[3] = 0x10325476;
+  
+  ctx->count_l = ctx->count_h = 0;
+  ctx->index = 0;
+}
+
+void
+md4_update(struct md4_ctx *ctx,
+	   unsigned length,
+	   const uint8_t *data)
+{
+  if (ctx->index)
+    {
+      /* Try to fill partial block */
+      unsigned left = MD4_DATA_SIZE - ctx->index;
+      if (length < left)
+	{
+	  memcpy(ctx->block + ctx->index, data, length);
+	  ctx->index += length;
+	  return; /* Finished */
+	}
+      else
+	{
+	  memcpy(ctx->block + ctx->index, data, left);
+	  md4_block(ctx, ctx->block);
+	  data += left;
+	  length -= left;
+	}
+    }
+  while (length >= MD4_DATA_SIZE)
+    {
+      md4_block(ctx, data);
+      data += MD4_DATA_SIZE;
+      length -= MD4_DATA_SIZE;
+    }
+  if ((ctx->index = length))     /* This assignment is intended */
+    /* Buffer leftovers */
+    memcpy(ctx->block, data, length);
+}
+
+void
+md4_digest(struct md4_ctx *ctx,
+	   unsigned length,
+	   uint8_t *digest)
+{
+  unsigned i;
+  unsigned words;
+  unsigned leftover;
+  
+  assert(length <= MD4_DIGEST_SIZE);
+
+  md4_final(ctx);
+  
+  words = length / 4;
+  leftover = length % 4;
+  
+  /* Little endian order */
+  for (i = 0; i < words; i++, digest += 4)
+    LE_WRITE_UINT32(digest, ctx->digest[i]);
+
+  if (leftover)
+    {
+      uint32_t word;
+      unsigned j;
+
+      assert(i < _MD4_DIGEST_LENGTH);
+      
+      /* Still least significant byte first. */
+      for (word = ctx->digest[i], j = 0; j < leftover;
+	   j++, word >>= 8)
+	digest[j] = word & 0xff;
+    }
+  md4_init(ctx);
+}
+
+/* MD4 functions */
+#define F(x, y, z) (((y) & (x)) | ((z) & ~(x)))
+#define G(x, y, z) (((y) & (x)) | ((z) & (x)) | ((y) & (z)))
+#define H(x, y, z) ((x) ^ (y) ^ (z))
+
+#define ROUND(f, w, x, y, z, data, s) \
+( w += f(x, y, z) + data,  w = w<<s | w>>(32-s) )
+
+/* Perform the MD4 transformation on one full block of 16 32-bit words. */
+   
+static void
+md4_transform(uint32_t *digest, const uint32_t *data)
+{
+  uint32_t a, b, c, d;
+  a = digest[0];
+  b = digest[1];
+  c = digest[2];
+  d = digest[3];
+
+  ROUND(F, a, b, c, d, data[ 0], 3);
+  ROUND(F, d, a, b, c, data[ 1], 7);
+  ROUND(F, c, d, a, b, data[ 2], 11);
+  ROUND(F, b, c, d, a, data[ 3], 19);
+  ROUND(F, a, b, c, d, data[ 4], 3);
+  ROUND(F, d, a, b, c, data[ 5], 7);
+  ROUND(F, c, d, a, b, data[ 6], 11);
+  ROUND(F, b, c, d, a, data[ 7], 19);
+  ROUND(F, a, b, c, d, data[ 8], 3);
+  ROUND(F, d, a, b, c, data[ 9], 7);
+  ROUND(F, c, d, a, b, data[10], 11);
+  ROUND(F, b, c, d, a, data[11], 19);
+  ROUND(F, a, b, c, d, data[12], 3);
+  ROUND(F, d, a, b, c, data[13], 7);
+  ROUND(F, c, d, a, b, data[14], 11);
+  ROUND(F, b, c, d, a, data[15], 19);
+
+  ROUND(G, a, b, c, d, data[ 0] + 0x5a827999, 3);
+  ROUND(G, d, a, b, c, data[ 4] + 0x5a827999, 5);
+  ROUND(G, c, d, a, b, data[ 8] + 0x5a827999, 9);
+  ROUND(G, b, c, d, a, data[12] + 0x5a827999, 13);
+  ROUND(G, a, b, c, d, data[ 1] + 0x5a827999, 3);
+  ROUND(G, d, a, b, c, data[ 5] + 0x5a827999, 5);
+  ROUND(G, c, d, a, b, data[ 9] + 0x5a827999, 9);
+  ROUND(G, b, c, d, a, data[13] + 0x5a827999, 13);
+  ROUND(G, a, b, c, d, data[ 2] + 0x5a827999, 3);
+  ROUND(G, d, a, b, c, data[ 6] + 0x5a827999, 5);
+  ROUND(G, c, d, a, b, data[10] + 0x5a827999, 9);
+  ROUND(G, b, c, d, a, data[14] + 0x5a827999, 13);
+  ROUND(G, a, b, c, d, data[ 3] + 0x5a827999, 3);
+  ROUND(G, d, a, b, c, data[ 7] + 0x5a827999, 5);
+  ROUND(G, c, d, a, b, data[11] + 0x5a827999, 9);
+  ROUND(G, b, c, d, a, data[15] + 0x5a827999, 13);
+
+  ROUND(H, a, b, c, d, data[ 0] + 0x6ed9eba1, 3);
+  ROUND(H, d, a, b, c, data[ 8] + 0x6ed9eba1, 9);
+  ROUND(H, c, d, a, b, data[ 4] + 0x6ed9eba1, 11);
+  ROUND(H, b, c, d, a, data[12] + 0x6ed9eba1, 15);
+  ROUND(H, a, b, c, d, data[ 2] + 0x6ed9eba1, 3);
+  ROUND(H, d, a, b, c, data[10] + 0x6ed9eba1, 9);
+  ROUND(H, c, d, a, b, data[ 6] + 0x6ed9eba1, 11);
+  ROUND(H, b, c, d, a, data[14] + 0x6ed9eba1, 15);
+  ROUND(H, a, b, c, d, data[ 1] + 0x6ed9eba1, 3);
+  ROUND(H, d, a, b, c, data[ 9] + 0x6ed9eba1, 9);
+  ROUND(H, c, d, a, b, data[ 5] + 0x6ed9eba1, 11);
+  ROUND(H, b, c, d, a, data[13] + 0x6ed9eba1, 15);
+  ROUND(H, a, b, c, d, data[ 3] + 0x6ed9eba1, 3);
+  ROUND(H, d, a, b, c, data[11] + 0x6ed9eba1, 9);
+  ROUND(H, c, d, a, b, data[ 7] + 0x6ed9eba1, 11);
+  ROUND(H, b, c, d, a, data[15] + 0x6ed9eba1, 15);
+
+  digest[0] += a;
+  digest[1] += b;
+  digest[2] += c;
+  digest[3] += d;
+}
+
+static void
+md4_block(struct md4_ctx *ctx, const uint8_t *block)
+{
+  uint32_t data[MD4_DATA_LENGTH];
+  unsigned i;
+  
+  /* Update block count */
+  if (!++ctx->count_l)
+    ++ctx->count_h;
+
+  /* Endian independent conversion */
+  for (i = 0; i<16; i++, block += 4)
+    data[i] = LE_READ_UINT32(block);
+
+  md4_transform(ctx->digest, data);
+}
+
+/* Final wrapup - pad to MD4_DATA_SIZE-byte boundary with the bit
+ * pattern 1 0* (64-bit count of bits processed, LSB-first) */
+
+static void
+md4_final(struct md4_ctx *ctx)
+{
+  uint32_t data[MD4_DATA_LENGTH];
+  unsigned i;
+  unsigned words;
+  
+  i = ctx->index;
+
+  /* Set the first char of padding to 0x80. This is safe since there
+   * is always at least one byte free */
+  assert(i < MD4_DATA_SIZE);
+  ctx->block[i++] = 0x80;
+
+  /* Fill rest of word */
+  for( ; i & 3; i++)
+    ctx->block[i] = 0;
+
+  /* i is now a multiple of the word size 4 */
+  words = i >> 2;
+  for (i = 0; i < words; i++)
+    data[i] = LE_READ_UINT32(ctx->block + 4*i);
+  
+  if (words > (MD4_DATA_LENGTH-2))
+    { /* No room for length in this block. Process it and
+       * pad with another one */
+      for (i = words ; i < MD4_DATA_LENGTH; i++)
+	data[i] = 0;
+      md4_transform(ctx->digest, data);
+      for (i = 0; i < (MD4_DATA_LENGTH-2); i++)
+	data[i] = 0;
+    }
+  else
+    for (i = words ; i < MD4_DATA_LENGTH - 2; i++)
+      data[i] = 0;
+  
+  /* There are 512 = 2^9 bits in one block 
+   * Little-endian order => Least significant word first */
+
+  data[MD4_DATA_LENGTH-1] = (ctx->count_h << 9) | (ctx->count_l >> 23);
+  data[MD4_DATA_LENGTH-2] = (ctx->count_l << 9) | (ctx->index << 3);
+  md4_transform(ctx->digest, data);
+}