1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/*
* dldp.h
*
* Discrete Logarithm Domain Parameters, header
*
* <conformance statement for IEEE P1363 needed here>
*
* Copyright (c) 2000, 2001 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 = qr+1; in case where p=2q+1, r=2
*
* In IEEE P1363 naming is p = rk+1
*
* Hence, IEEE prime r = q and cofactor k = r
*
* 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
int dldp_pInit(dldp_p* dp)
/*@modifies dp */;
BEEDLLAPI
int dldp_pFree(dldp_p* dp)
/*@modifies dp */;
BEEDLLAPI
int dldp_pCopy(dldp_p* dst, const dldp_p* src)
/*@modifies dst */;
/*
* Functions for generating keys
*/
BEEDLLAPI
int dldp_pPrivate(const dldp_p* dp, randomGeneratorContext* rgc, mp32number* x)
/*@modifies dp, x */;
BEEDLLAPI
int dldp_pPublic (const dldp_p* dp, const mp32number* x, mp32number* y)
/*@modifies y */;
BEEDLLAPI
int dldp_pPair (const dldp_p* dp, randomGeneratorContext* rgc, mp32number* x, mp32number* y)
/*@modifies x, y */;
/*
* Function for comparing domain parameters
*/
BEEDLLAPI
int dldp_pEqual (const dldp_p* a, const dldp_p* b)
/*@*/;
/*
* Functions for generating and validating dldp_pgoq variant domain parameters
*/
BEEDLLAPI
int dldp_pgoqMake (dldp_p* dp, randomGeneratorContext* rgc, uint32 psize, uint32 qsize, int cofactor)
/*@modifies dp, rgc */;
BEEDLLAPI
int dldp_pgoqMakeSafe (dldp_p* dp, randomGeneratorContext* rgc, uint32 psize)
/*@modifies dp, rgc */;
BEEDLLAPI
int dldp_pgoqGenerator(dldp_p* dp, randomGeneratorContext* rgc)
/*@modifies dp, rgc */;
BEEDLLAPI
int dldp_pgoqValidate (const dldp_p*, randomGeneratorContext* rgc, int cofactor)
/*@modifies rgc @*/;
/*
* Functions for generating and validating dldp_pgon variant domain parameters
*/
BEEDLLAPI
int dldp_pgonMake (dldp_p* dp, randomGeneratorContext* rgc, uint32 psize, uint32 qsize)
/*@modifies dp, rgc */;
BEEDLLAPI
int dldp_pgonMakeSafe (dldp_p* dp, randomGeneratorContext* rgc, uint32 psize)
/*@modifies dp, rgc */;
BEEDLLAPI
int dldp_pgonGenerator(dldp_p* dp, randomGeneratorContext* rgc)
/*@modifies dp, rgc */;
BEEDLLAPI
int dldp_pgonValidate (const dldp_p* dp, randomGeneratorContext* rgc)
/*@modifies rgc @*/;
#ifdef __cplusplus
}
#endif
#endif
|
