In this paper, we study and give the first detailed benchmarks on existing implementations of the secp256k1 elliptic curve used by at least hundreds of thousands of users in Bitcoin and other cryptocurrencies. Our implementation improves the state of the art by a factor of 2.5, with a focus on the cases where side channel attacks are not a concern and a large quantity of RAM is available. As a result, we are able to scan the Bitcoin blockchain for weak keys faster than any previous implementation. We also give some examples of passwords which have we have cracked, showing that brain wallets are not secure in practice even for quite complex passwords.
@article{459,
title = {Speed optimizations in bitkoin key recovery attacks},
journal = {Tatra Mountains Mathematical Publications},
volume = {65},
year = {2016},
doi = {10.2478/tatra.v67i0.459},
language = {EN},
url = {http://dml.mathdoc.fr/item/459}
}
Courtois, Nicolas; Song, Guangyan; Castellucci, Ryan. Speed optimizations in bitkoin key recovery attacks. Tatra Mountains Mathematical Publications, Tome 65 (2016) . doi : 10.2478/tatra.v67i0.459. http://gdmltest.u-ga.fr/item/459/