<label class="col-sm-3 control-label" data-translate>Mnemonic Length</label>
<div class="col-sm-9">
<select class="mnemonic-length form-control">
- <option value="raw" data-translate>From entropy length (3 words per 32 bits)</option>
+ <option value="raw" selected data-translate>Use Raw Entropy (3 words per 32 bits)</option>
<option value="12">12 <span data-translate>Words</span></option>
- <option value="15" selected>15 <span data-translate>Words</option>
+ <option value="15">15 <span data-translate>Words</option>
<option value="18">18 <span data-translate>Words</span></option>
<option value="21">21 <span data-translate>Words</span></option>
<option value="24">24 <span data-translate>Words</span></option>
random enough for the needs of this tool.
</span>
</p>
+ <p>
+ <strong><span data-translate>Do not store entropy.</span></strong>
+ </p>
+ <p>
+ <span data-translate>Storing entropy (such as keeping a deck of cards in a specific shuffled order) is unreliable compared to storing a mnemonic.</span>
+ <span data-translate>Instead of storing entropy, store the mnemonic generated from the entropy.</span>
+ <span data-translate-html><a href="https://en.wikipedia.org/wiki/Steganography#Physical" target="_blank">Steganography</a> may be beneficial when storing the mnemonic.</span>
+ </p>
<p>
<span data-translate-html>
The random mnemonic generator on this page uses a
// Create a normalized string of the selected cards
var normalizedCards = cards.join("").toUpperCase();
// Convert to binary using the SHA256 hash of the normalized cards.
- // If the number of bits is more than 256, multiple rounds of hashing
+ // If the number of bits is more than 256, multiple hashes
// are used until the required number of bits is reached.
var entropyBin = "";
var iterations = 0;
while (entropyBin.length < numberOfBits) {
- var hashedCards = sjcl.hash.sha256.hash(normalizedCards);
- for (var j=0; j<iterations; j++) {
- hashedCards = sjcl.hash.sha256.hash(hashedCards);
- }
+ var hashedCards = sjcl.hash.sha256.hash(normalizedCards + ":" + iterations);
var hashHex = sjcl.codec.hex.fromBits(hashedCards);
for (var i=0; i<hashHex.length; i++) {
var decimal = parseInt(hashHex[i], 16);
// mnemonics is populated as required by getLanguage
var mnemonics = { "english": new Mnemonic("english") };
var mnemonic = mnemonics["english"];
- var seed = null
+ var seed = null;
var bip32RootKey = null;
var bip32ExtendedKey = null;
var network = bitcoin.networks.bitcoin;
var phraseChangeTimeoutEvent = null;
var rootKeyChangedTimeoutEvent = null;
+ var generationProcesses = [];
+
var DOM = {};
DOM.network = $(".network");
DOM.phraseNetwork = $("#network-phrase");
// Calculate and display
calcBip32RootKeyFromBase58(rootKeyBase58);
calcForDerivationPath();
- hidePending();
}
function calcForDerivationPath() {
showPending();
+ clearAddressesList();
hideValidationError();
// Get the derivation path
var derivationPath = getDerivationPath();
}
function calcBip32ExtendedKey(path) {
+ // Check there's a root key to derive from
+ if (!bip32RootKey) {
+ return bip32RootKey;
+ }
var extendedKey = bip32RootKey;
// Derive the key from the path
var pathBits = path.split("/");
continue;
}
var hardened = bit[bit.length-1] == "'";
- if (hardened) {
+ var isPriv = "privKey" in extendedKey;
+ var invalidDerivationPath = hardened && !isPriv;
+ if (invalidDerivationPath) {
+ extendedKey = null;
+ }
+ else if (hardened) {
extendedKey = extendedKey.deriveHardened(index);
}
else {
}
}
}
+ // Check root key exists or else derivation path is useless!
+ if (!bip32RootKey) {
+ return "No root key";
+ }
+ // Check no hardened derivation path when using xpub keys
+ var hardened = path.indexOf("'") > -1;
+ var isXpubkey = !("privKey" in bip32RootKey);
+ if (hardened && isXpubkey) {
+ return "Hardened derivation path is invalid with xpub key";
+ }
return false;
}
DOM.seed.val(seed);
var rootKey = bip32RootKey.toBase58();
DOM.rootKey.val(rootKey);
- var extendedPrivKey = bip32ExtendedKey.toBase58();
+ var xprvkeyB58 = "NA";
+ if (bip32ExtendedKey.privKey) {
+ xprvkeyB58 = bip32ExtendedKey.toBase58();
+ }
+ var extendedPrivKey = xprvkeyB58;
DOM.extendedPrivKey.val(extendedPrivKey);
var extendedPubKey = bip32ExtendedKey.toBase58(false);
DOM.extendedPubKey.val(extendedPubKey);
}
function displayAddresses(start, total) {
- for (var i=0; i<total; i++) {
- var index = i + start;
- new TableRow(index);
- }
+ generationProcesses.push(new (function() {
+
+ var rows = [];
+
+ this.stop = function() {
+ for (var i=0; i<rows.length; i++) {
+ rows[i].shouldGenerate = false;
+ }
+ }
+
+ for (var i=0; i<total; i++) {
+ var index = i + start;
+ rows.push(new TableRow(index));
+ }
+
+ })());
}
function TableRow(index) {
+ var self = this;
+ this.shouldGenerate = true;
var useHardenedAddresses = DOM.hardenedAddresses.prop("checked");
function init() {
function calculateValues() {
setTimeout(function() {
+ if (!self.shouldGenerate) {
+ return;
+ }
var key = "";
if (useHardenedAddresses) {
key = bip32ExtendedKey.deriveHardened(index);
key = bip32ExtendedKey.derive(index);
}
var address = key.getAddress().toString();
- var privkey = key.privKey.toWIF(network);
+ var privkey = "NA";
+ if (key.privKey) {
+ privkey = key.privKey.toWIF(network);
+ }
var pubkey = key.pubKey.toHex();
var indexText = getDerivationPath() + "/" + index;
if (useHardenedAddresses) {
function clearAddressesList() {
DOM.addresses.empty();
+ stopGenerating();
+ }
+
+ function stopGenerating() {
+ while (generationProcesses.length > 0) {
+ var generation = generationProcesses.shift();
+ generation.stop();
+ }
}
function clearKey() {
var closestWord = words[0];
for (var i=0; i<words.length; i++) {
var comparedTo = words[i];
+ if (comparedTo.indexOf(word) == 0) {
+ return comparedTo;
+ }
var distance = Levenshtein.get(word, comparedTo);
if (distance < minDistance) {
closestWord = comparedTo;
var hash = sjcl.hash.sha256.hash(entropy.cleanStr);
var hex = sjcl.codec.hex.fromBits(hash);
bits = BigInteger.parse(hex, 16).toString(2);
- for (var i=0; i<256-bits.length; i++) {
+ while (bits.length % 256 != 0) {
bits = "0" + bits;
}
// Truncate hash to suit number of words