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
|
/*
* Copyright (C) 2013 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "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 COPYRIGHT
* OWNER OR CONTRIBUTORS 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.
*/
#include "config.h"
#include "modules/crypto/CryptoKey.h"
#include "bindings/core/v8/ExceptionState.h"
#include "core/dom/ExceptionCode.h"
#include "platform/CryptoResult.h"
#include "public/platform/WebCryptoAlgorithmParams.h"
#include "public/platform/WebCryptoKeyAlgorithm.h"
#include "public/platform/WebString.h"
namespace blink {
namespace {
const char* keyTypeToString(WebCryptoKeyType type)
{
switch (type) {
case WebCryptoKeyTypeSecret:
return "secret";
case WebCryptoKeyTypePublic:
return "public";
case WebCryptoKeyTypePrivate:
return "private";
}
ASSERT_NOT_REACHED();
return 0;
}
struct KeyUsageMapping {
WebCryptoKeyUsage value;
const char* const name;
};
// The order of this array is the same order that will appear in
// CryptoKey.usages. It must be kept ordered as described by the Web Crypto
// spec.
const KeyUsageMapping keyUsageMappings[] = {
{ WebCryptoKeyUsageEncrypt, "encrypt" },
{ WebCryptoKeyUsageDecrypt, "decrypt" },
{ WebCryptoKeyUsageSign, "sign" },
{ WebCryptoKeyUsageVerify, "verify" },
{ WebCryptoKeyUsageDeriveKey, "deriveKey" },
{ WebCryptoKeyUsageDeriveBits, "deriveBits" },
{ WebCryptoKeyUsageWrapKey, "wrapKey" },
{ WebCryptoKeyUsageUnwrapKey, "unwrapKey" },
};
static_assert(EndOfWebCryptoKeyUsage == (1 << 7) + 1, "keyUsageMappings needs to be updated");
const char* keyUsageToString(WebCryptoKeyUsage usage)
{
for (size_t i = 0; i < WTF_ARRAY_LENGTH(keyUsageMappings); ++i) {
if (keyUsageMappings[i].value == usage)
return keyUsageMappings[i].name;
}
ASSERT_NOT_REACHED();
return 0;
}
WebCryptoKeyUsageMask keyUsageStringToMask(const String& usageString)
{
for (size_t i = 0; i < WTF_ARRAY_LENGTH(keyUsageMappings); ++i) {
if (keyUsageMappings[i].name == usageString)
return keyUsageMappings[i].value;
}
return 0;
}
} // namespace
CryptoKey::~CryptoKey()
{
}
CryptoKey::CryptoKey(const WebCryptoKey& key)
: m_key(key)
{
}
String CryptoKey::type() const
{
return keyTypeToString(m_key.type());
}
bool CryptoKey::extractable() const
{
return m_key.extractable();
}
// FIXME: This creates a new javascript array each time. What should happen
// instead is return the same (immutable) array. (Javascript callers can
// distinguish this by doing an == test on the arrays and seeing they are
// different).
Vector<String> CryptoKey::usages() const
{
Vector<String> result;
for (size_t i = 0; i < WTF_ARRAY_LENGTH(keyUsageMappings); ++i) {
WebCryptoKeyUsage usage = keyUsageMappings[i].value;
if (m_key.usages() & usage)
result.append(keyUsageToString(usage));
}
return result;
}
bool CryptoKey::canBeUsedForAlgorithm(const WebCryptoAlgorithm& algorithm, WebCryptoKeyUsage usage, CryptoResult* result) const
{
if (!(m_key.usages() & usage)) {
result->completeWithError(WebCryptoErrorTypeInvalidAccess, "key.usages does not permit this operation");
return false;
}
if (m_key.algorithm().id() != algorithm.id()) {
result->completeWithError(WebCryptoErrorTypeInvalidAccess, "key.algorithm does not match that of operation");
return false;
}
return true;
}
bool CryptoKey::parseFormat(const String& formatString, WebCryptoKeyFormat& format, CryptoResult* result)
{
// There are few enough values that testing serially is fast enough.
if (formatString == "raw") {
format = WebCryptoKeyFormatRaw;
return true;
}
if (formatString == "pkcs8") {
format = WebCryptoKeyFormatPkcs8;
return true;
}
if (formatString == "spki") {
format = WebCryptoKeyFormatSpki;
return true;
}
if (formatString == "jwk") {
format = WebCryptoKeyFormatJwk;
return true;
}
result->completeWithError(WebCryptoErrorTypeType, "Invalid keyFormat argument");
return false;
}
bool CryptoKey::parseUsageMask(const Vector<String>& usages, WebCryptoKeyUsageMask& mask, CryptoResult* result)
{
mask = 0;
for (size_t i = 0; i < usages.size(); ++i) {
WebCryptoKeyUsageMask usage = keyUsageStringToMask(usages[i]);
if (!usage) {
result->completeWithError(WebCryptoErrorTypeType, "Invalid keyUsages argument");
return false;
}
mask |= usage;
}
return true;
}
} // namespace blink
|
