nexus/bip39
2
0
Fork 0
mirror of https://github.com/OneKeyHQ/bip39.git synced 2026-04-18 08:22:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

added code to calculate hack time of split cards

Browse Source
This commit is contained in:
Matthew Cornelisse
2018-11-28 01:12:29 -06:00
committed by GitHub
parent 8253325365
commit 5cdbe4620a
1 changed files with 13 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
src/js/index.js
View File

@@ -45,6 +45,7 @@
DOM.entropyFilterWarning = DOM.entropyContainer.find(".filter-warning"); DOM.entropyFilterWarning = DOM.entropyContainer.find(".filter-warning");
DOM.phrase = $(".phrase"); DOM.phrase = $(".phrase");
DOM.splitPhrase = $(".phraseSplit"); DOM.splitPhrase = $(".phraseSplit");
DOM.phraseSplitWarn = $(".phraseSplitWarn");
DOM.passphrase = $(".passphrase"); DOM.passphrase = $(".passphrase");
DOM.generateContainer = $(".generate-container"); DOM.generateContainer = $(".generate-container");
DOM.generate = $(".generate"); DOM.generate = $(".generate");
@@ -1276,6 +1277,18 @@
cards[i]='Card '+(i+1)+': '+wordArrayToPhrase(cards[i]); //combine words on card back to string cards[i]='Card '+(i+1)+': '+wordArrayToPhrase(cards[i]); //combine words on card back to string
} }
DOM.splitPhrase.val(cards.join("\r\n")); //make words visible DOM.splitPhrase.val(cards.join("\r\n")); //make words visible
var triesPerSecond=10000000000; //assumed number of tries per second
var hackTime=Math.pow(2,wordCount*10/3)/triesPerSecond; //get number of bits of unknown data per card
if (hackTime<1) {
hackTime="<1 second";
} else if (hackTime<86400) {
hackTime=Math.floor(hackTime)+" seconds";
} else if(hackTime<31557600) {
hackTime=Math.floor(hackTime/86400)+" days";
} else {
hackTime=Math.floor(hackTime/31557600)+" years";
}
DOM.phraseSplitWarn.html("Time to hack with only one card: "+hackTime);
} }
function isUsingOwnEntropy() { function isUsingOwnEntropy() {