Quote from: COBRAS on Today at 12:00:52 AM

Quote from: De_to4ka on February 11, 2025, 11:21:36 PM

Quote from: COBRAS on February 11, 2025, 10:49:22 PM

Quote from: De_to4ka on February 11, 2025, 10:44:19 PM

Quote from: mcdouglasx on February 11, 2025, 03:47:43 AM

Quote from: De_to4ka on February 11, 2025, 12:39:36 AM

There have already been examples, what other proof do you need?

Reviewing their code, just to clarify, the trick seems to be that the signed message includes the nonce concatenated as part of the string. Somehow, the OP extracts the nonce from here, which allows them to derive the private key. In short, their code generates vulnerable signatures. The nonce should never be included in the message of a signature because it is a catastrophic vulnerability.

Code:

def generate_signatures(self, priv, num_signatures=10):
   sigs = []
   for _ in range(num_signatures):
   nonce = random.randrange(1, 2**BIT_RANGE)
   note = str(os.urandom(25)) + str(nonce)
   msg = bytes(note, 'utf-8')
   private_key, public_key = self.make_keypair(priv)
   r, s, z = self.sign_message(priv, msg, nonce)
   sigs.append((z, r, s))
   return sigs

Yes, Hello I have already seen similar codes, where when generating fake signatures, a nonce is also generated. By the way, Bitcoined has shown several times that its code outputs the correct value of the private key, I have seen it myself.

nonce too smal:

nonce = random.randrange(1, 2**BIT_RANGE)

Hi Cobras, have you talked to him, maybe you learned something interesting about this code? His code is interesting, he needs a maximum of 10 signatures and it doesn't matter if they are fake or from the blockchain and the whole work takes about 10 minutes and I think so and he doesn't need CPU, GPU, it's just some kind of happiness

he tell this in groop chat in tg:

Code:

Ok fine

we want to solve

d = (s*r)-z * k mod p.

i only know s, r, z and p

Can you rearange that so that we need to solve for z?

z = (s * r - d) / k mod p

Ok

nothing more

Quote

Renloi:
[['0x51d65b53e0c05560ec8d8a8a26a15a5967aa642af0f5dc7ddd89d4478bc3e971', '0xaf4de1b694cd4622ffe8d8cdf5329a31c7f818c9320af86163abe8ac1600b3a8', '0xaf4de1b694cd4622ffe8d8cdf5329a31c7f818c9320af86163abe8ac1600b3a8']]

signature for puzzle 135
z, r, s is the order

S:
So u solved puzzle 135 yes ?

he start generate "valid" or real valud "sighnatures without peivkey. Maybe sach sigh work for transfer btc without orivkey

maybe someone can briadcast this rsz to blockchain and try transfer 135 bit puzzle?

Yes, I understand, Cobras, thank you.