Deterministic keys are based on the sha256 hashing function. As described in the link below deterministic keys use the same hashing function.


Is it possible for an FPGA to be repurposed to quickly find the hashes for poorly chosen keys?


An FPGA can do anything, by definition (Field Programmable Gate Array) they can run any bitstream you care to write for a specific task. The BIP0032 wallets you're thinking of however are 128bit keys with significant key stretching, so not a chance in hell will you ever crack one. That's by design.

  • Yes the entropy of the key is interesting to me... Most of the Bip32 generators come from a source that has less entropy. Namely 12 words of the English language. The permeations of that is much less than 2^128 ... But it would be interesting to know the difference in magnitude. – halfbit Feb 16 '14 at 23:46
  • Brainwallet.org has a nice demonstration of how BIP32 works. Select "electrum" and "generate". You can see just how the root key and chain code interact in real time. The written word backup is just another form of encoding the chain code. – user13413 Feb 17 '14 at 0:31
  • @makerofthings7: In order for 12 words to have at least 2^128 bits of entropy, each word would come from a pool of at least 2^(128/12) which is about 2^11. That's only about 2000 words, and there are far more than that in English. – Greg Hewgill Feb 17 '14 at 19:40
  • There is a list of 2048 "commonly" used words (some are not as common as others), which are used for other protocols (S/Key en.wikipedia.org/wiki/S/KEY#Usability ); Since each word has 11 bits of entropy (2^11=2048), 12 words would have 12*11=132 bits of data. If this is like S/Key, this might be 128 bits of data, and a 4-bit checksum. Or it might be all data. – AMADANON Inc. Feb 17 '14 at 21:13

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.