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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
/*
* Copyright (c) 2010 .SE (The Internet Infrastructure Foundation)
* 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.
*
* 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.
*/
/*****************************************************************************
BotanGOSTPublicKey.cpp
Botan GOST R 34.10-2001 public key class
*****************************************************************************/
#include "config.h"
#ifdef WITH_GOST
#include "log.h"
#include "BotanGOSTPublicKey.h"
#include "BotanUtil.h"
#include <string.h>
// Constructors
BotanGOSTPublicKey::BotanGOSTPublicKey()
{
eckey = NULL;
}
BotanGOSTPublicKey::BotanGOSTPublicKey(const Botan::GOST_3410_PublicKey* inECKEY)
{
BotanGOSTPublicKey();
setFromBotan(inECKEY);
}
// Destructor
BotanGOSTPublicKey::~BotanGOSTPublicKey()
{
delete eckey;
}
// The type
/*static*/ const char* BotanGOSTPublicKey::type = "Botan GOST Public Key";
// Get the base point order length
unsigned long BotanGOSTPublicKey::getOrderLength() const
{
try
{
Botan::EC_Group group = BotanUtil::byteString2ECGroup(ec);
return group.get_order().bytes();
}
catch (...)
{
ERROR_MSG("Can't get EC group for order length");
return 0;
}
}
// Get the output length
unsigned long BotanGOSTPublicKey::getOutputLength() const
{
return getOrderLength() * 2;
}
// Set from Botan representation
void BotanGOSTPublicKey::setFromBotan(const Botan::GOST_3410_PublicKey* inECKEY)
{
ByteString inEC = BotanUtil::ecGroup2ByteString(inECKEY->domain());
setEC(inEC);
ByteString inQ = BotanUtil::ecPoint2ByteString(inECKEY->public_point()).substr(3);
/* The points must be stored in little endian */
const size_t length = inQ.size() / 2;
for (size_t i = 0; i < (length / 2); i++)
{
std::swap(inQ[i], inQ[length-1-i]);
std::swap(inQ[length+i], inQ[2*length-1-i]);
}
setQ(inQ);
}
// Check if the key is of the given type
bool BotanGOSTPublicKey::isOfType(const char* inType)
{
return !strcmp(type, inType);
}
// Setters for the GOST public key components
void BotanGOSTPublicKey::setEC(const ByteString& inEC)
{
GOSTPublicKey::setEC(inEC);
if (eckey)
{
delete eckey;
eckey = NULL;
}
}
void BotanGOSTPublicKey::setQ(const ByteString& inQ)
{
GOSTPublicKey::setQ(inQ);
if (eckey)
{
delete eckey;
eckey = NULL;
}
}
// Serialisation
ByteString BotanGOSTPublicKey::serialise() const
{
return ec.serialise() +
q.serialise();
}
bool BotanGOSTPublicKey::deserialise(ByteString& serialised)
{
ByteString dEC = ByteString::chainDeserialise(serialised);
ByteString dQ = ByteString::chainDeserialise(serialised);
if ((dEC.size() == 0) ||
(dQ.size() == 0))
{
return false;
}
setEC(dEC);
setQ(dQ);
return true;
}
// Retrieve the Botan representation of the key
Botan::GOST_3410_PublicKey* BotanGOSTPublicKey::getBotanKey()
{
if (!eckey)
{
createBotanKey();
}
return eckey;
}
// Create the Botan representation of the key
void BotanGOSTPublicKey::createBotanKey()
{
if (ec.size() != 0 &&
q.size() != 0)
{
if (eckey)
{
delete eckey;
eckey = NULL;
}
try
{
/* The points are stored in little endian */
ByteString bPoint = q;
const size_t length = bPoint.size() / 2;
for (size_t i = 0; i < (length / 2); i++)
{
std::swap(bPoint[i], bPoint[length-1-i]);
std::swap(bPoint[length+i], bPoint[2*length-1-i]);
}
ByteString p = "044104" + bPoint;
Botan::EC_Group group = BotanUtil::byteString2ECGroup(ec);
Botan::PointGFp point = BotanUtil::byteString2ECPoint(p, group);
eckey = new Botan::GOST_3410_PublicKey(group, point);
}
catch (...)
{
ERROR_MSG("Could not create the Botan public key");
}
}
}
#endif
|
