alex777

Not gonna happen. You can’t derive it from the x value, aka r. I generated r myself, so I know what the actual nonce is.

I should have been clearer, my bad. Yes, I have the signature and the public key that was used to sign the message.

Thanks for that. I've seen the calculation. So for the lattice attack, I realize I need three signatures. If the bits are all the same in three signatures, it’s doable even if I don’t know the nonce. But in my case, I…

Hey everyone, I’ve got a scenario to toss around. Imagine I know 120 bits of the nonce that was used in a transaction signature. I only have one transaction though. Is there any way to reverse-engineer the private key…

Found a couple of keys in under 3 seconds. Still need to try more.

Could be. I got the DB generated with a million pubs and was testing search times for a couple of puzzles.

I’m currently trying to implement the math.random() function as it was back in the day. I noticed that Chrome and Firefox had different ways of doing things. Does anyone have a working version?

Hey everyone, I’m diving into this project where I’m trying to use the Randstorm vulnerability to crack the puzzle. Here’s my GitHub repo if you’re interested.

@krashfire took 6 weeks, which seems kind of lucky. You should check out his previous posts for rsz info.

Running this on a GPU will definitely speed things up. I could whip up a CUDA program for it.

That's a solid point! But I'm curious, how does secp160k1 even help with secp256k1? Is there a way to link them? I’ve got some endomorphism values handy. Trying to piece together the equations here...…

I’m thinking of brute-forcing k with bsgs or kangaroo, making pubkey and base point for nonce from r, s, z.

I’m not following. Are you saying that k1 and k2 are inverses of each other, or is it just the nonces that are inverse? Clarify please.