-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathalmost.js
More file actions
269 lines (228 loc) · 6.56 KB
/
almost.js
File metadata and controls
269 lines (228 loc) · 6.56 KB
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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
'use strict';
var almost = {};
(function () {
var wordlist = [];
var loadCallbacks = [];
var isLoading = false;
var loadError = null;
var maxWords = 1000;
var expectedWordCount = 7776;
var expectedWordlistSha256 =
'e06e7d4c695f85d39a79ebefe9b4c403e40ddcd5e65c5eac6c2be541c4619da9';
function normalizeHowMany(howMany) {
var parsed = Number(howMany);
if (!isFinite(parsed) || parsed < 1) {
return 1;
}
parsed = Math.floor(parsed);
if (parsed > maxWords) {
return maxWords;
}
return parsed;
}
function toWordIndex(randomValue, listLength) {
// 0x0000..0xFFFF maps to 0..(listLength - 1)
return Math.floor((randomValue / 65536) * listLength);
}
function extractWordsFromWordlistData(data) {
var lines = data.split('\n');
var line;
var extractedWords = [];
var match;
var i;
for (i = 0; i < lines.length; i++) {
line = lines[i];
if (line === '-----BEGIN PGP SIGNED MESSAGE-----') {
continue;
}
if (line === 'Hash: SHA256') {
continue;
}
if (line === '') {
continue;
}
if (
line ===
'https://www.eff.org/deeplinks/2016/07/new-wordlists-random-passphrases'
) {
continue;
}
if (line === '-----BEGIN PGP SIGNATURE-----') {
break;
}
match = /^\d{5}\s(.+)$/.exec(line);
if (match) {
extractedWords.push(match[1]);
}
}
return extractedWords;
}
function getSubtleCrypto() {
var c = window.crypto || window.msCrypto;
if (c && c.subtle && c.subtle.digest) {
return c.subtle;
}
return null;
}
function textToUtf8Bytes(text) {
var utf8;
var bytes;
var i;
if (typeof TextEncoder !== 'undefined') {
return new TextEncoder().encode(text);
}
// Fallback for older engines that lack TextEncoder.
utf8 = unescape(encodeURIComponent(text));
bytes = new Uint8Array(utf8.length);
for (i = 0; i < utf8.length; i++) {
bytes[i] = utf8.charCodeAt(i);
}
return bytes;
}
function bytesToHex(buffer) {
var bytes = new Uint8Array(buffer);
var hex = '';
var i;
var byteHex;
for (i = 0; i < bytes.length; i++) {
byteHex = bytes[i].toString(16);
if (byteHex.length === 1) {
byteHex = '0' + byteHex;
}
hex += byteHex;
}
return hex;
}
function flushLoadCallbacks(error) {
var callback;
while (loadCallbacks.length > 0) {
callback = loadCallbacks.shift();
callback(error);
}
}
function hasExpectedWordCount(words) {
return words.length === expectedWordCount;
}
function hasExpectedWordlistHash(digestHex) {
return digestHex === expectedWordlistSha256;
}
function verifyWordlistSha256(data, callback) {
var subtle = getSubtleCrypto();
if (!subtle) {
callback('Error: Cannot verify word list integrity in this browser.');
return;
}
subtle
.digest('SHA-256', textToUtf8Bytes(data))
.then(function (hashBuffer) {
var digestHex = bytesToHex(hashBuffer);
if (!hasExpectedWordlistHash(digestHex)) {
callback('Error: Word list integrity check failed.');
return;
}
callback(null);
})
.catch(function () {
callback('Error: Failed to verify word list integrity.');
});
}
almost._internal = {
normalizeHowMany: normalizeHowMany,
toWordIndex: toWordIndex,
extractWordsFromWordlistData: extractWordsFromWordlistData,
hasExpectedWordCount: hasExpectedWordCount,
hasExpectedWordlistHash: hasExpectedWordlistHash,
expectedWordlistSha256: expectedWordlistSha256,
};
almost.load = function (callback) {
var request;
var extractedWords;
if (typeof callback !== 'function') {
callback = function () {};
}
if (wordlist.length > 0) {
// It's already loaded
callback(null);
return;
}
loadCallbacks.push(callback);
if (isLoading) {
return;
}
// Retry on demand after transient request errors.
loadError = null;
isLoading = true;
// Requires a web server; CORS will reject loading this via the file: protocol
request = new XMLHttpRequest();
request.open('GET', 'eff_large_wordlist.asc', true);
request.onload = function () {
var wordlistData;
if (request.status >= 200 && request.status < 400) {
wordlistData = request.responseText;
verifyWordlistSha256(wordlistData, function (verificationError) {
if (verificationError) {
loadError = verificationError;
isLoading = false;
flushLoadCallbacks(loadError);
return;
}
extractedWords = extractWordsFromWordlistData(wordlistData);
if (!hasExpectedWordCount(extractedWords)) {
loadError =
'Error: Could not parse the expected Diceware list (7776 words).';
isLoading = false;
flushLoadCallbacks(loadError);
return;
}
wordlist = extractedWords;
isLoading = false;
flushLoadCallbacks(null);
});
return;
}
loadError = 'Error: Failed to load word list (HTTP ' + request.status + ').';
isLoading = false;
flushLoadCallbacks(loadError);
};
request.onerror = function () {
loadError = 'Error: Network problem while loading word list.';
isLoading = false;
flushLoadCallbacks(loadError);
};
request.send();
};
almost.getWords = function (howMany) {
var c = window.crypto || window.msCrypto;
var howManyNumber;
var array;
var words;
var word;
var i;
var j;
if (!wordlist.length) {
return 'Error: Word list is not loaded yet. Please try again.';
}
if (c && c.getRandomValues) {
// Get random values using a cryptographically sound method
// http://stackoverflow.com/questions/5651789/is-math-random-cryptographically-secure
howManyNumber = normalizeHowMany(howMany);
// Edge requires explicit type conversion
array = new Uint16Array(howManyNumber);
c.getRandomValues(array);
words = [];
for (i = 0; i < array.length; i++) {
j = toWordIndex(array[i], wordlist.length);
word = wordlist[j];
words.push(word);
}
return words.join(' ');
}
return (
'Error: Cannot find a cryptographically sound random number generator. ' +
'Please try another more modern browser.'
);
};
})();
if (typeof module !== 'undefined' && module.exports) {
module.exports = almost;
}