summaryrefslogtreecommitdiff
path: root/beecrypt/dlpk.c
blob: fd50828bfeb02c713768f16c276a610344a2b60c (plain)
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
/*
 * Copyright (c) 2000, 2001, 2002 Virtual Unlimited B.V.
 *
 * 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
 *
 */

/*!\file dlpk.c
 * \brief Discrete Logarithm public key.
 * \author Bob Deblier <bob.deblier@pandora.be>
 * \ingroup DL_m
 */

#include "system.h"
#include "dlpk.h"
#include "mp.h"
#include "debug.h"

/*!\addtogroup DL_m
 * \{
 */

int dlpk_pInit(dlpk_p* pk)
{
	if (dldp_pInit(&pk->param) < 0)
		return -1;

	mpnzero(&pk->y);

	return 0;
}

int dlpk_pFree(dlpk_p* pk)
{
	/*@-usereleased -compdef @*/ /* pk->param.{p,q,n}.modl is OK */
	if (dldp_pFree(&pk->param) < 0)
		return -1;

	mpnfree(&pk->y);

	return 0;
	/*@=usereleased =compdef @*/
}

int dlpk_pCopy(dlpk_p* dst, const dlpk_p* src)
{
	if (dldp_pCopy(&dst->param, &src->param) < 0)
		return -1;

	mpncopy(&dst->y, &src->y);

	return 0;
}

int dlpk_pEqual(const dlpk_p* a, const dlpk_p* b)
{
	return dldp_pEqual(&a->param, &b->param) &&
		mpeqx(a->y.size, a->y.data, b->y.size, b->y.data);
}

int dlpk_pgoqValidate(const dlpk_p* pk, randomGeneratorContext* rgc, int cofactor)
{
	register int rc = dldp_pgoqValidate(&pk->param, rgc, cofactor);

	if (rc <= 0)
		return rc;

	if (mpleone(pk->y.size, pk->y.data))
		return 0;

	if (mpgex(pk->y.size, pk->y.data, pk->param.p.size, pk->param.p.modl))
		return 0;

	return 1;
}

int dlpk_pgonValidate(const dlpk_p* pk, randomGeneratorContext* rgc)
{
	register int rc = dldp_pgonValidate(&pk->param, rgc);

	if (rc <= 0)
		return rc;

	if (mpleone(pk->y.size, pk->y.data))
		return 0;

	if (mpgex(pk->y.size, pk->y.data, pk->param.p.size, pk->param.p.modl))
		return 0;

	return 1;
}

/*!\}
 */