📅 Original date posted:2015-01-31
📝 Original message:Den 1 feb 2015 00:05 skrev "Brian Erdelyi" <brian.erdelyi at gmail.com>:
>>
>> See vanitygen. Yes, 8 characters can be brute forced.
>
> Thank you for this reference. Interesting to see that there is a tool to
generate a vanity bitcoin address.
>
> I am still researching viruses that are designed to manipulate a bitcoin
address. I suspect they are primitive in that they use a hardcoded rogue
bitcoin address as opposed to dynamically generating one.
>
> As a start, this would help protect against malware that uses a static
rogue bitcoin address. The next thing would be for the malware to
brute-force the legitimate bitcoin address and generate a rogue bitcoin
address that would produce the same 8 digit code. Curious to know how long
this brute force would take? Or perhaps, before converting to 8 digits
there is some other hashing function that is performed.
>
> Brian Erdelyi
To bruteforce 8 decimals, on average you need (10^8)/2 = 50 000 000 tries.
log(50M)/log(2) = 25.6 bits of entropy.
One try = generate a random number, use it to generate an ECDSA keypair,
SHA256 and RIPEMD160 hash the public key per Bitcoin specs, then run that
OCRA hashing code, then compare strings. Considering the ECDSA operations
is by a large margin slower than all the hash functions, consider them to
just add a small percentage in performance drop vs regular vanitygen usage.
My non-gaming laptop performed IIRC at *a few million keys per second* with
OpenCL. I've used it to search for 6 character strings in the base58
Bitcoin addresses with it in 15 minutes to half an hour or so. That's about
35 bits of entropy (rough estimate, there's some details with padding in
the base58 representation that alters it).
So 2^(35-26) ~= 1 in 500 of that time, and that's if you use a laptop
instead of a GPU rig. Seconds at worst. Milliseconds if done on a rig.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20150201/aaf8f5e0/attachment.html>;
Natanael [ARCHIVE] /
npub179…lpmjt
2023-06-07 15:29:12
in reply to nevent1q…0dth
Author Public Key
npub1798ncudyucap9jzzujjsgufx8tdykm8auzfledjcs6f6wf4ekqvq8lpmjtPublished at
2023-06-07 15:29:12Event JSON
{
"id": "f3f5b4e0e73394312f6d81e8c543ffaf99fd52fb9ec88b6e7020b28ae609a2b1",
"pubkey": "f14f3c71a4e63a12c842e4a50471263ada4b6cfde093fcb6588693a726b9b018",
"created_at": 1686151752,
"kind": 1,
"tags": [
[
"e",
"0501e25ac3e871ae4f2e2d290b8141447534c7b89577ccdbac4adbe5a22e7a1d",
"",
"root"
],
[
"e",
"d877619556b7b3872eb16ccc8c3f5c65343ac5fb24b41282ad5b1e6041a0ccae",
"",
"reply"
],
[
"p",
"5f57805600aff24704ce401a57e78ba1631be95f18e62e28fb3168e3be1ea5c5"
]
],
"content": "📅 Original date posted:2015-01-31\n📝 Original message:Den 1 feb 2015 00:05 skrev \"Brian Erdelyi\" \u003cbrian.erdelyi at gmail.com\u003e:\n\u003e\u003e\n\u003e\u003e See vanitygen. Yes, 8 characters can be brute forced.\n\u003e\n\u003e Thank you for this reference. Interesting to see that there is a tool to\ngenerate a vanity bitcoin address.\n\u003e\n\u003e I am still researching viruses that are designed to manipulate a bitcoin\naddress. I suspect they are primitive in that they use a hardcoded rogue\nbitcoin address as opposed to dynamically generating one.\n\u003e\n\u003e As a start, this would help protect against malware that uses a static\nrogue bitcoin address. The next thing would be for the malware to\nbrute-force the legitimate bitcoin address and generate a rogue bitcoin\naddress that would produce the same 8 digit code. Curious to know how long\nthis brute force would take? Or perhaps, before converting to 8 digits\nthere is some other hashing function that is performed.\n\u003e\n\u003e Brian Erdelyi\n\nTo bruteforce 8 decimals, on average you need (10^8)/2 = 50 000 000 tries.\nlog(50M)/log(2) = 25.6 bits of entropy.\n\nOne try = generate a random number, use it to generate an ECDSA keypair,\nSHA256 and RIPEMD160 hash the public key per Bitcoin specs, then run that\nOCRA hashing code, then compare strings. Considering the ECDSA operations\nis by a large margin slower than all the hash functions, consider them to\njust add a small percentage in performance drop vs regular vanitygen usage.\n\nMy non-gaming laptop performed IIRC at *a few million keys per second* with\nOpenCL. I've used it to search for 6 character strings in the base58\nBitcoin addresses with it in 15 minutes to half an hour or so. That's about\n35 bits of entropy (rough estimate, there's some details with padding in\nthe base58 representation that alters it).\n\nSo 2^(35-26) ~= 1 in 500 of that time, and that's if you use a laptop\ninstead of a GPU rig. Seconds at worst. Milliseconds if done on a rig.\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20150201/aaf8f5e0/attachment.html\u003e",
"sig": "7246033ebc7c3662ce83d50a6afc63deff76e5fd8af493fdbc7e560a925955f1a71460907438e46d95f219644680a805e75426b6bcd81fc7d435d24c9dc2c630"
}