This repository has been archived by the owner on May 20, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 80
/
diceware.js
98 lines (86 loc) · 2.65 KB
/
diceware.js
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
/**
* diceware.js - generate N distinct words from a dictionary of 7776 possibilities
*/
function Diceware() {
this.wordlist = [];
if (typeof Math.log2 === 'undefined') {
Math.log2 = function(N) {
return Math.log(N)/Math.log(2)
};
}
}
Diceware.prototype.load = function(callback) {
var that = this;
$.get("/data/diceware.wordlist.asc", function(data) {
var line = '';
var split = data.split("\n");
var l = split.length;
for (var i = 0; i < l; i++) {
line = split[i];
if (line === '-----BEGIN PGP SIGNED MESSAGE-----' || line === '') {
continue;
}
if (line === '-----BEGIN PGP SIGNATURE-----') {
break;
}
var myregexp = /^\s*\d+\s*([^\s]+)\s*$/;
var match = myregexp.exec(line);
if (match != null) {
// matched text: match[0]
// match start: match.index
// capturing group n: match[n]
that.wordlist.push(match[1]);
}
}
callback();
});
}
/**
* Return a number of diceware words
* @param int words - the number of words to generate
*/
Diceware.prototype.getWords = function(words) {
if (!window.crypto || !window.crypto.getRandomValues) {
return [];
}
var diced = [];
for (var i = 0; i < words; ++i) {
diced.push(this.getSingleWord());
}
return diced;
};
// http://stackoverflow.com/questions/18230217/javascript-generate-a-random-number-within-a-range-using-crypto-getrandomvalues
Diceware.prototype.random = function (min, max) {
var rval = 0;
var range = max - min;
var bits_needed = Math.ceil(Math.log2(range));
if (bits_needed > 53) {
throw new Exception("We cannot generate numbers larger than 53 bits.");
}
var bytes_needed = Math.ceil(bits_needed / 8);
var mask = Math.pow(2, bits_needed) - 1;
// 7776 -> (2^13 = 8192) -1 == 8191 or 0x00001111 11111111
// Create byte array and fill with N random numbers
var byteArray = new Uint8Array(bytes_needed);
window.crypto.getRandomValues(byteArray);
var p = (bytes_needed - 1) * 8;
for(var i = 0; i < bytes_needed; i++ ) {
rval += byteArray[i] * Math.pow(2, p);
p -= 8;
}
// Use & to apply the mask and reduce the number of recursive lookups
rval = rval & mask;
if (rval >= range) {
// Integer out of acceptable range
return this.random(min, max);
}
// Return an integer that falls within the range
return min + rval;
}
Diceware.prototype.getSingleWord = function() {
if (!window.crypto || !window.crypto.getRandomValues) {
return null;
}
var index = this.random(0, this.wordlist.length);
return this.wordlist[index];
};