2 votes

How to use smt solvers in order to restrict the possible key search where a portion of the private key and a portion of the public key hash is known?

search for the public key which then… That's infeasible if we hash public keys that are not chosen according to what's known of the private key. It would require about $2^{160}$ hashes to find one ...
fgrieu's user avatar
  • 141k

Only top scored, non community-wiki answers of a minimum length are eligible