X-Git-Url: https://git.immae.eu/?a=blobdiff_plain;f=src%2Fjs%2Findex.js;h=12788ab3da7b41620ac6f7ad08a0c2997d5148e8;hb=dedae1a9d604773143d13b496feeafd7b85084f4;hp=b03f2c8aee98a3c8d5606f898cc7b5803f7a12a5;hpb=d6fd8ebf8667cad13392aff185fa5da7a7e82cbe;p=perso%2FImmae%2FProjets%2FCryptomonnaies%2FBIP39.git diff --git a/src/js/index.js b/src/js/index.js index b03f2c8..12788ab 100644 --- a/src/js/index.js +++ b/src/js/index.js @@ -791,43 +791,118 @@ } function showEntropyFeedback(entropy) { + var numberOfBits = entropy.binaryStr.length; var strength = "extremely weak"; - if (entropy.binaryStr.length >= 64) { + if (numberOfBits >= 64) { strength = "very weak"; } - if (entropy.binaryStr.length >= 96) { + if (numberOfBits >= 96) { strength = "weak"; } - if (entropy.binaryStr.length >= 128) { + if (numberOfBits >= 128) { strength = "strong"; } - if (entropy.binaryStr.length >= 160) { + if (numberOfBits >= 160) { strength = "very strong"; } - if (entropy.binaryStr.length >= 192) { + if (numberOfBits >= 192) { strength = "extremely strong"; } // If time to crack is less than one day, and password is considered // strong or better based on the number of bits, rename strength to // 'easily cracked'. - var z = zxcvbn(entropy.cleanStr); - var timeToCrack = z.crack_times_seconds.offline_fast_hashing_1e10_per_second; - if (timeToCrack < 86400 && entropy.binaryStr.length >= 128) { - strength = "easily cracked"; - if (z.feedback.warning != "") { - strength = strength + " - " + z.feedback.warning; - }; - } - var bitsStr = entropy.binaryStr.length; - var wordCount = Math.floor(entropy.binaryStr.length / 32) * 3; + try { + var z = zxcvbn(entropy.base.parts.join("")); + var timeToCrack = z.crack_times_seconds.offline_fast_hashing_1e10_per_second; + if (timeToCrack < 86400 && entropy.binaryStr.length >= 128) { + strength = "easily cracked"; + if (z.feedback.warning != "") { + strength = strength + " - " + z.feedback.warning; + }; + } + } + catch (e) { + strength = "unknown"; + console.log("Error detecting entropy strength with zxcvbn:"); + console.log(e); + } + var entropyTypeStr = getEntropyTypeStr(entropy); + var wordCount = Math.floor(numberOfBits / 32) * 3; + var bitsPerEvent = Math.log2(entropy.base.asInt).toFixed(2); + if (entropy.base.asInt == 52) { + bitsPerEvent = (4.3381).toFixed(2); // log2(52! / 52) + } DOM.entropyFiltered.html(entropy.cleanHtml); - DOM.entropyType.text(entropy.base.str); + DOM.entropyType.text(entropyTypeStr); DOM.entropyStrength.text(strength); DOM.entropyEventCount.text(entropy.base.ints.length); - DOM.entropyBits.text(bitsStr); + DOM.entropyBits.text(numberOfBits); DOM.entropyWordCount.text(wordCount); DOM.entropyBinary.text(entropy.binaryStr); - DOM.entropyBitsPerEvent.text(Math.log2(entropy.base.asInt).toFixed(2)); + DOM.entropyBitsPerEvent.text(bitsPerEvent); + } + + function getEntropyTypeStr(entropy) { + var typeStr = entropy.base.str; + // Add some detail if these are cards + if (entropy.base.asInt == 52) { + var cardDetail = []; // array of message strings + // Detect duplicates + var dupes = []; + var dupeTracker = {}; + for (var i=0; i 0) { + var dupeWord = "duplicates"; + if (dupes.length == 1) { + dupeWord = "duplicate"; + } + var msg = dupes.length + " " + dupeWord + ": " + dupes.slice(0,3).join(" "); + if (dupes.length > 3) { + msg += "..."; + } + cardDetail.push(msg); + } + // Detect full deck + var uniqueCards = []; + for (var uniqueCard in dupeTracker) { + uniqueCards.push(uniqueCard); + } + if (uniqueCards.length == 52) { + cardDetail.unshift("full deck"); + } + // Detect missing cards + var values = "A23456789TJQK"; + var suits = "CDHS"; + var missingCards = []; + for (var i=0; i 0 && missingCards.length <= 6) { + var msg = missingCards.length + " missing: " + missingCards.slice(0,3).join(" "); + if (missingCards.length > 3) { + msg += "..."; + } + cardDetail.push(msg); + } + // Add card details to typeStr + if (cardDetail.length > 0) { + typeStr += " (" + cardDetail.join(", ") + ")"; + } + } + return typeStr; } var networks = [