Technically, not all 256 bit numbers are valid ECDSA priv keys. In the secp256k1 curve there's a very very small chance that your key won't be valid. That chance is so small that it will never happen. Here's a way to create a private key with the openssl lib: https://bitcointalk.org/index.php?topic=132061.msg1415456#msg1415456Most of that code is the encoding, the key is created by a few simple openssl commands in the end. If you're gonna use the shell, use /dev/random instead of /dev/urandom for maximum paranoid mode. It might not be instant depending on your system's stored entropy though so get ready to move your mouse around like a monkey on crack in order to generate more entropy and make it finish faster.
|
|
|
78427939?
29a253dbe3d494581e30dfae3fd363f78427939cf2e467369b0fea2fba0e6c667e37f888d14b2a3 cc1153f552b1cbf9d504436aa9221eb0c123b9f555733dd22 was the full whirlpool output?
And where did you use that?
Correct, thats the phone and now you have to slice it out of the string since he loses it.
|
|
|
This is how I did the whirlpool thingy: $phonefound = false;
function whirlphone($stuff) { global $phonefound;
$out = hash('whirlpool', $stuff); $offset = 0; again: $pos = strpos($out, '78', $offset); if ($pos !== false && !$phonefound) { $phone = substr($out, $pos, 8); if (ctype_digit($phone) && strlen($phone) == 8) { $phonefound = true; echo 'Possible phone: ' . $phone . "\n"; echo 'preout: ' . $out . "\n"; $out = substr($out, 0, $pos) . substr($out, $pos + 8); echo 'aftout: ' . $out . "\n"; return $out; } else { $offset = $pos + 2; goto again; } }
return $out; }
$start = whirlphone($start . '+alice');
for ($i = 1; $i <= 50; $i++) { $start = whirlphone($start); }
Yeah sue me for using goto ![Cheesy](https://bitcointalk.org/Smileys/default/cheesy.gif) I had to do it fast
|
|
|
Gotcha!
cozz: Thanks for the BTC and this awesome contest.
I could have gotten this 30 minutes ago but I was too stupid including the phone after the ripemd hash
|
|
|
Everyone knows hollywood is 100% real
|
|
|
the fat guy is Xerxes king of the Persians
"Who are you calling fat sillybuns? I look ultra fabulous." ![](https://ip.bitcointalk.org/?u=http%3A%2F%2Fthemovieblog.com%2Fwp-content%2Fuploads%2F2010%2F07%2Fxerxes.jpg&t=663&c=lUqDOlY0kbLs_w)
|
|
|
nope. cant remember Snefru being ass-kicked by a fat guy.
That "born before jesus" thing was too strong. Then it must be GOST and the fat guy is USA, lol.
|
|
|
nope. git is the friend of the friend. so who could be that friend?
SHA1 (used by git) then again it might be related to Linus
|
|
|
The friend I visited in europe looks so old
Could be the string "enigma" concatenated
|
|
|
but his name sounds like japanese
Might refer to Satoshi therefore RIPEMD160(SHA256(SHA256(x))) This is still too hard
|
|
|
The friend I visited in europe looks so old
Has to be MD2 or MD4
|
|
|
correct. you win 1BTC. whats your btc address?
14r9f5paWs67S8ixqssSvpN3yuiChA3Pcb he literally is a stupid or unpleasant person.
ROT13? I never felt like I had to add another entering somewhere.
No line feeds for all hashes
|
|
|
He has won his first race championship in 1996 in europe driving with a speed of 160 miles per hour. RIPEMD160 (published in 1996)
|
|
|
Sorry for the poor terminology (I am actually far from being an encryption expert) but I am hoping the point being that "it only takes a bit of creativity" to create a secure password is being made (rather than the "brainwallet" approach).
I don't see how this is not a brainwallet too. It would be like creating an electrum 10 word passphrase, remembering only 4 of them and writing 6 of them down on a piece of paper. You're just adding the entropy either way. The difference is that you can easily calculate the entropy of a brainwallet. Your function however not so much. So you won't know how secure it is.
|
|
|
Why would you? The idea is that you have to change the script to create your *own* puzzle.
I understand that creating entropy is not easy (and I am certainly not trying to trivialise this problem) but I think it doesn't need to be nearly as hard as trying to remember huge passwords.
If your key derivation is secret then what you are essentially doing is using that as your password as well. Because to decrypt it you dont only have to remember your 4 chars, but you also have to remember the exact formula of the key derivation.
|
|
|
Oh really - then why hasn't this been cracked already?
First of all, you're implying that just because we haven't cracked it in 10 hours then it will never be cracked. Secondly, we don't know the exact implementation of your key derivation function.
|
|
|
I have a much better bash script that I am including with a custom Open SUSE distro (which I am still putting together) - that will be a hell of a lot more challenging than this to crack (the point being similar to Mike Caldwell's one that you don't need to remember a huge password to get good security). ![Smiley](https://bitcointalk.org/Smileys/default/smiley.gif) This is security by obscurity though. Once they know about your implementation it will be easily cracked. Why not use a well scrutinized key derivation function and run 10 million iterations of it?
|
|
|
How are the rest of you going - want that hint earlier or happy to wait till until confirmation # 200?
Whatever you decide let us know now. I am also throwing in the towel after 210 or so tries. Been running it since yesterday on a 16 core Xeon.
|
|
|
|