Initial revision

CVS patchset: 5051
CVS date: 2001/09/18 19:23:46

1 files changed, 122 insertions, 0 deletions

diff --git a/beecrypt/dldp.h b/beecrypt/dldp.h
new file mode 100644
index 000000000..62a5504d8
--- /dev/null
+++ b/beecrypt/dldp.h
@@ -0,0 +1,122 @@
+/*
+ * dldp.h
+ *
+ * Discrete Logarithm Domain Parameters, header
+ *
+ * <conformance statement for IEEE P1363 needed here>
+ *
+ * Copyright (c) 2000 Virtual Unlimited B.V.
+ *
+ * Author: Bob Deblier <bob@virtualunlimited.com>
+ *
+ * This 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.
+ *
+ * This 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 this library; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ *
+ */
+
+#ifndef _DLDP_H
+#define _DLDP_H
+
+#include "beecrypt.h"
+#include "mp32barrett.h"
+
+/*
+ * Discrete Logarithm Domain Parameters - Prime
+ *
+ * Standard definition where p = 2qr+1; in case where p=2q+1, r=1
+ *
+ * IEEE P1363 definition is p = rk+1
+ *
+ * Hence, IEEE r = q and IEEE cofactor k = 2 or k = 2r
+ *
+ * Make sure q is large enough to foil Pohlig-Hellman attacks
+ *  See: "Handbook of Applied Cryptography", Chapter 3.6.4
+ *
+ * g is either a generator of a subgroup of order q, or a generator of order
+ *  n = (p-1)
+ */
+
+typedef struct
+{
+	mp32barrett p;
+	mp32barrett q;
+	mp32number  r;
+	mp32number  g;
+	mp32barrett n;
+} dldp_p;
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * Functions for setting up and copying
+ */
+
+BEEDLLAPI
+void dldp_pInit(dldp_p*);
+BEEDLLAPI
+void dldp_pFree(dldp_p*);
+BEEDLLAPI
+void dldp_pCopy(dldp_p*, const dldp_p*);
+
+/*
+ * Functions for generating keys
+ */
+
+BEEDLLAPI
+void dldp_pPrivate(const dldp_p*, randomGeneratorContext*, mp32number*);
+BEEDLLAPI
+void dldp_pPublic (const dldp_p*, const mp32number*, mp32number*);
+BEEDLLAPI
+void dldp_pPair   (const dldp_p*, randomGeneratorContext*, mp32number*, mp32number*);
+
+/*
+ * Function for comparing domain parameters
+ */
+
+BEEDLLAPI
+int  dldp_pEqual  (const dldp_p*, const dldp_p*);
+
+/*
+ * Functions for generating and validating dldp_pgoq variant domain parameters
+ */
+
+BEEDLLAPI
+void dldp_pgoqMake     (dldp_p*, randomGeneratorContext*, uint32, uint32, int);
+BEEDLLAPI
+void dldp_pgoqMakeSafe (dldp_p*, randomGeneratorContext*, uint32);
+BEEDLLAPI
+void dldp_pgoqGenerator(dldp_p*, randomGeneratorContext*);
+BEEDLLAPI
+int  dldp_pgoqValidate (const dldp_p*, randomGeneratorContext*, int);
+
+/*
+ * Functions for generating and validating dldp_pgon variant domain parameters
+ */
+
+BEEDLLAPI
+void dldp_pgonMake     (dldp_p*, randomGeneratorContext*, uint32, uint32);
+BEEDLLAPI
+void dldp_pgonMakeSafe (dldp_p*, randomGeneratorContext*, uint32);
+BEEDLLAPI
+void dldp_pgonGenerator(dldp_p*, randomGeneratorContext*);
+BEEDLLAPI
+int  dldp_pgonValidate (const dldp_p*, randomGeneratorContext*);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif