Initial import of isakmpd, an IKE (ISAKMP/Oakley) implementation for the

OpenBSD IPSEC stack by me, Niklas Hallqvist and Niels Provos, funded by
Ericsson Radio Systems.  It is not yet complete or usable in a real scenario
but the missing pieces will soon be there.  The early commit is for people
who wants early access and who are not afraid of looking at source.
isakmpd interops with Cisco, Timestep, SSH & Pluto (Linux FreeS/WAN) so
far, so it is not that incomplete.  It is really mostly configuration that
is lacking.

2 files changed, 125 insertions, 0 deletions

diff --git a/sbin/isakmpd/regress/prf/Makefile b/sbin/isakmpd/regress/prf/Makefile
new file mode 100644
index 00000000000..7d58f825d23
--- /dev/null
+++ b/sbin/isakmpd/regress/prf/Makefile
@@ -0,0 +1,10 @@
+# Test HMAC:
+
+PROG=		prftest
+SRCS=		log.c prf.c hash.c prftest.c
+.PATH:		${.CURDIR}/../../
+NOMAN=
+CFLAGS+=	-I${.CURDIR}/../../ -Wall
+DEBUG=		-g
+
+.include <bsd.prog.mk>
diff --git a/sbin/isakmpd/regress/prf/prftest.c b/sbin/isakmpd/regress/prf/prftest.c
new file mode 100644
index 00000000000..1ba253865aa
--- /dev/null
+++ b/sbin/isakmpd/regress/prf/prftest.c
@@ -0,0 +1,115 @@
+/*	$Id: prftest.c,v 1.1 1998/11/15 00:03:50 niklas Exp $	*/
+
+/*
+ * Copyright (c) 1998 Niels Provos.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *	This product includes software developed by Ericsson Radio Systems.
+ * 4. The name of the author may not be used to endorse or promote products
+ *    derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/*
+ * This code was written under funding by Ericsson Radio Systems.
+ */
+
+#include <sys/param.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+
+#include "hash.h"
+#include "prf.h"
+
+int test_prf(char *, enum hashes, char *, int, char *, int, char *);
+
+#define nibble2c(x) ((x) >= 10 ? ('a'-10+(x)) : ('0' + (x)))
+
+/*
+ * Basically the same as the HMAC regress, but to keep with modularity
+ * prf seems to be useful. So here we just check the HMAC test cases,
+ * until there are more PRFs.
+ */
+
+int
+main (void)
+{
+  char key[100];
+    
+  memset(key, 11, 20);
+  test_prf ("PRF MD5 Test Case 1", HASH_MD5,
+	     key, 16, "Hi There", 8, "9294727a3638bb1c13f48ef8158bfc9d");
+  test_prf ("PRF MD5 Test Case 2", HASH_MD5,
+	     "Jefe", 4,
+	     "what do ya want for nothing?", 28,
+	     "750c783e6ab0b503eaa86e310a5db738");
+  test_prf ("PRF SHA1 Test Case 1", HASH_SHA1,
+	     key, 20, "Hi There", 8, 
+	     "b617318655057264e28bc0b6fb378c8ef146be00");
+  test_prf ("PRF SHA1 Test Case 2",  HASH_SHA1,
+	     "Jefe", 4, "what do ya want for nothing?", 28, 
+	     "effcdf6ae5eb2fa2d27416d5f184df9c259a7c79");
+  
+  return 1;
+}
+
+int
+test_prf(char *test, enum hashes hash, char *key, int klen,
+	  char *data, int dlen, char *cmp)
+{
+  char output[2*HASH_MAX+1];
+  char digest[HASH_MAX];
+  struct prf *prf;
+  int i;
+
+  printf("Testing %s: ", test);
+
+  prf = prf_alloc(PRF_HMAC, hash, key, klen);
+  if (prf == NULL) 
+    {
+      printf("prf_alloc() returned NULL\n");
+      return 0;
+    }
+
+  prf->Init(prf->prfctx);
+  prf->Update(prf->prfctx, data, dlen);
+  prf->Final(digest, prf->prfctx);
+
+  prf_free(prf);
+
+  for (i=0; i<prf->blocksize; i++)
+    {
+      output[2*i] = nibble2c((digest[i] >> 4) & 0xf);
+      output[2*i+1] = nibble2c(digest[i] & 0xf);
+    }
+  output[2*i] = 0;
+
+  if (!strcmp(output, cmp)) 
+    {
+      printf("OKAY\n");
+      return 1;
+    }
+
+  printf("%s <-> %s\n", output, cmp);
+  return 0;
+}