Search content
Sort by
Showing 15 of 15 results by De_to4ka
No. And never cared about it.
Ok. A-one.
Hi Alex, do you know how to restore the original value without mod n, but I can decompose the value)) well, within reason. Thank youA-one.
Hi Alexander, off topic, but do you know how to return the original value without mod n? ThanksRe: Can someone provide 3 examples of r,s,z and nonce data ?
Can you provide the code with pm?
Good day
Can someone provide 3 examples of r,s,z and nonce data ?
nonce need <= 100
?
Thank you very much.
Can someone provide 3 examples of r,s,z and nonce data ?
nonce need <= 100
?
Thank you very much.
you ask code for make fff jast substrate
Hello Cobras, did you get the message?
modmath 0x157cb65b27a820acb0df711e28550521930 - 0x80000000000000000000000000000000000000000000000000000000000000000000000000000 00000000000000
and you get fff in start
dont listen crazy zelar zombie, zelar talk sheet about me because he disappointed what he not find 120 bit puzzle and company what provide GPU to him ask money from him, but hi has no 1 mln $ ...
Please check OP's feedback and decide whether you're still willing to trust him.
In my post I newer ask trust me, all people's can verify what I talk about !!! This is not zombie club what you so like.
How is it different than Lattice Reduction method. Where for 200 bit Nonce we can solve using 7 or 8 Signatures.
Code:
Leakage: 5 bit. Sigs Needed:71
Leakage:10 bit. Sigs Needed:36
Leakage:15 bit. Sigs Needed:24
Leakage:20 bit. Sigs Needed:18
Leakage:25 bit. Sigs Needed:15
Leakage:30 bit. Sigs Needed:12
Leakage:56 bit. Sigs Needed:7
Leakage:10 bit. Sigs Needed:36
Leakage:15 bit. Sigs Needed:24
Leakage:20 bit. Sigs Needed:18
Leakage:25 bit. Sigs Needed:15
Leakage:30 bit. Sigs Needed:12
Leakage:56 bit. Sigs Needed:7
I can do 240 bits using 10 signatures. Can lattice do that?
How is it different than Lattice Reduction method. Where for 200 bit Nonce we can solve using 7 or 8 Signatures.
Code:
Leakage: 5 bit. Sigs Needed:71
Leakage:10 bit. Sigs Needed:36
Leakage:15 bit. Sigs Needed:24
Leakage:20 bit. Sigs Needed:18
Leakage:25 bit. Sigs Needed:15
Leakage:30 bit. Sigs Needed:12
Leakage:56 bit. Sigs Needed:7
Leakage:10 bit. Sigs Needed:36
Leakage:15 bit. Sigs Needed:24
Leakage:20 bit. Sigs Needed:18
Leakage:25 bit. Sigs Needed:15
Leakage:30 bit. Sigs Needed:12
Leakage:56 bit. Sigs Needed:7
I can do 240 bits using 10 signatures. Can lattice do that?
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
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
nonce too smal:
nonce = random.randrange(1, 2**BIT_RANGE)
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
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 ?
[['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?
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
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
nonce too smal:
nonce = random.randrange(1, 2**BIT_RANGE)
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
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
I've been on this forum for a while, and all the methods to recover a private key were trash.
I'm very skeptical about yours, but I was kind of surprised by the examples you showed.
Can you please try this one? 135 bits
The signatures are in the format you requested Z,R,S.
Public Key (X, Y):
(14583650402052046191194717552574143597839470300155777702187845716125065931581, 110658969513486452358151052273695883261147073763470201295459829818398609189289)
[["0x5f3fa0301abc8851184a4f2eb341943b1ed5ecb91b5dea13d4347005f1e5d793", "0xc9d9738562ff79a333302d5d1480c730995d020206ea1fd34d3f934b3169fa24", "0xadc5ba964b06250cf81e7dc159b74b20c253d25769267cd83e3680fefb326332"], ["0x7383448524bc17c9756b04bafca6e574bd7511081c8ed181417927bbd01a3674", "0x4da378b7d2c580914451ba8c659227cbcd85665c4bbc9cc8d131f29d85cb48be", "0xc99e32b635042baa18eceae34e328b537a27d21aad44b0230b6588beba15f1dc"], ["0x15056cf8fad9af7ec28a30d8e45bbaa7ad05e8121f3fafef87458d2a3e44d93c", "0x97a21c2faced7afdeba2d6d265448bc2945e4bfeb19dec3dd2eef471ce17e9a8", "0xfd1ad41f64ff59981064806fadfe974e41e302804280ad8819d6c1f1b0919d18"], ["0x1b7c012423861656ffd4ada338f290a7cf041eebd12da09c00cbe0dde3903266", "0xd69b9d36d66a93c29c3c554685587088f5f01fcd8fd16f90b7111916f59bdc58", "0x5f83b65256ad735a948166de9c1942f810b79714d6b357e8af7c1ab8edda0950"], ["0xdf0e5d08fea8de152fbd0dfdf661c6006a7821dadecc91cfabe3b9b4d69f6f7b", "0x7b72d864f943496e52d08b764b5832253db5ba2becc68200e23a985ddbde418b", "0x51de05c88e5dc55c8b0f2c278db42746f44e9f2ffcfb6d3aa36455a468fed82a"], ["0x3a2bd0d713b6d66893168e1cf4305839220bbe17d123e966baa35a7e31e8e7ac", "0x7500ccbdf0128827c5977f5f0ba017f5f460857d66948827d1641131192f5b80", "0x96948bdb4e4c79e95ca7ac16ef19147551cc2868f13a8aeacd73385c35e1a612"], ["0x5dde8cd500d2660078da55702e0d67a2eac9cc873115d3079c9c69286669e5a8", "0x983663cb72c652ec405b15173e974dda251a98edce44b99c3dee4650aec88a60", "0xa4a3fd9571e8b4fac0645e6a06c5571505818acc16230e530709ec7a8fff0e51"], ["0x67c4bb5c8dac73631467bb83e1a4a2945d816011613eca0fbfa91d3d39eda089", "0x1db0fc70d3759bc9234d4b05b512a2a389cc487b165bcfef4b47e5339ad88bc0", "0x41042572a25bcdfb360da3376f091738621b202d9324b78c8af71f06a83b9105"], ["0x7cdff47c626778d697776f766b83674ef90510d5721c63e1575636aeebc134c8", "0x61191aa05488263c68ccb63ab4d52b79643b4f91253a8963286b62d933248193", "0x319c8a71d1e53e9f05549c68706d51cdd29c5086be916260381b1a9807fb06b9"], ["0x56515175f9930ad039e6250fc08cc1c9c76c362d6428f8f8be601fea53490922", "0x94700ebfa50beede7309e5715054d66ada2e7bad436d1d28a71503b8150a6f4d", "0xa357ee0276188750db58933c1a2a432334180d80f393bb485e9cefd72ee250fe"]]
There have already been examples, what other proof do you need?I'm very skeptical about yours, but I was kind of surprised by the examples you showed.
Can you please try this one? 135 bits
The signatures are in the format you requested Z,R,S.
Public Key (X, Y):
(14583650402052046191194717552574143597839470300155777702187845716125065931581, 110658969513486452358151052273695883261147073763470201295459829818398609189289)
[["0x5f3fa0301abc8851184a4f2eb341943b1ed5ecb91b5dea13d4347005f1e5d793", "0xc9d9738562ff79a333302d5d1480c730995d020206ea1fd34d3f934b3169fa24", "0xadc5ba964b06250cf81e7dc159b74b20c253d25769267cd83e3680fefb326332"], ["0x7383448524bc17c9756b04bafca6e574bd7511081c8ed181417927bbd01a3674", "0x4da378b7d2c580914451ba8c659227cbcd85665c4bbc9cc8d131f29d85cb48be", "0xc99e32b635042baa18eceae34e328b537a27d21aad44b0230b6588beba15f1dc"], ["0x15056cf8fad9af7ec28a30d8e45bbaa7ad05e8121f3fafef87458d2a3e44d93c", "0x97a21c2faced7afdeba2d6d265448bc2945e4bfeb19dec3dd2eef471ce17e9a8", "0xfd1ad41f64ff59981064806fadfe974e41e302804280ad8819d6c1f1b0919d18"], ["0x1b7c012423861656ffd4ada338f290a7cf041eebd12da09c00cbe0dde3903266", "0xd69b9d36d66a93c29c3c554685587088f5f01fcd8fd16f90b7111916f59bdc58", "0x5f83b65256ad735a948166de9c1942f810b79714d6b357e8af7c1ab8edda0950"], ["0xdf0e5d08fea8de152fbd0dfdf661c6006a7821dadecc91cfabe3b9b4d69f6f7b", "0x7b72d864f943496e52d08b764b5832253db5ba2becc68200e23a985ddbde418b", "0x51de05c88e5dc55c8b0f2c278db42746f44e9f2ffcfb6d3aa36455a468fed82a"], ["0x3a2bd0d713b6d66893168e1cf4305839220bbe17d123e966baa35a7e31e8e7ac", "0x7500ccbdf0128827c5977f5f0ba017f5f460857d66948827d1641131192f5b80", "0x96948bdb4e4c79e95ca7ac16ef19147551cc2868f13a8aeacd73385c35e1a612"], ["0x5dde8cd500d2660078da55702e0d67a2eac9cc873115d3079c9c69286669e5a8", "0x983663cb72c652ec405b15173e974dda251a98edce44b99c3dee4650aec88a60", "0xa4a3fd9571e8b4fac0645e6a06c5571505818acc16230e530709ec7a8fff0e51"], ["0x67c4bb5c8dac73631467bb83e1a4a2945d816011613eca0fbfa91d3d39eda089", "0x1db0fc70d3759bc9234d4b05b512a2a389cc487b165bcfef4b47e5339ad88bc0", "0x41042572a25bcdfb360da3376f091738621b202d9324b78c8af71f06a83b9105"], ["0x7cdff47c626778d697776f766b83674ef90510d5721c63e1575636aeebc134c8", "0x61191aa05488263c68ccb63ab4d52b79643b4f91253a8963286b62d933248193", "0x319c8a71d1e53e9f05549c68706d51cdd29c5086be916260381b1a9807fb06b9"], ["0x56515175f9930ad039e6250fc08cc1c9c76c362d6428f8f8be601fea53490922", "0x94700ebfa50beede7309e5715054d66ada2e7bad436d1d28a71503b8150a6f4d", "0xa357ee0276188750db58933c1a2a432334180d80f393bb485e9cefd72ee250fe"]]
230 bit:
....
.....
..
pubkey:
04a2e0e99ceac47a3dd83f33434523f09ba8b35b773c795fe1c5a370f1e73456e92fb40ba82f4ec 010bdb0800872656a9e1eef6d1627259850bea1671880c779bc
?
I'm running some unrelated tests now, it'll finish soon and i'll send it. if you can send the x and y of the public key it'll be good.
I made dec for pubkey later and send it.
The private key for the 230 bit public key is
1606810226048941903531730621352970454741442315642201293890991507745196
confirm:
print(0x3b99934a8858ffa79d9a6d7a7f3ba4c82ced80430118adfc885d45a9ac
try 256?
after 256 need check 256 with nonce <252
after after test or real data
so, time to go to "dark web anonimous" is little fare away ))
It works on real data as you seen.
I can confirm that i already did that on 256 bit keys and it works.
if you want we can chat privately, i don't want to make things too public on the internet.
If you know some advanced math DM me. but don't expect me to provide any tools or codes.
me to
try sending me a private message now.
Just join this telegram group
https://t.me/+-qZAZBYuwbRlMzI0
https://www.talkimg.com/images/2025/02/10/egjn1.jpeg
you need update setting Go to
Personal Message Options > Allow newbies to send you PMs.
230 bit:
....
.....
..
pubkey:
04a2e0e99ceac47a3dd83f33434523f09ba8b35b773c795fe1c5a370f1e73456e92fb40ba82f4ec 010bdb0800872656a9e1eef6d1627259850bea1671880c779bc
?
I'm running some unrelated tests now, it'll finish soon and i'll send it. if you can send the x and y of the public key it'll be good.
I made dec for pubkey later and send it.
The private key for the 230 bit public key is
1606810226048941903531730621352970454741442315642201293890991507745196
confirm:
print(0x3b99934a8858ffa79d9a6d7a7f3ba4c82ced80430118adfc885d45a9ac
try 256?
after 256 need check 256 with nonce <252
after after test or real data
so, time to go to "dark web anonimous" is little fare away ))
It works on real data as you seen.
I can confirm that i already did that on 256 bit keys and it works.
if you want we can chat privately, i don't want to make things too public on the internet.
If you know some advanced math DM me. but don't expect me to provide any tools or codes.
me to
try sending me a private message now.
230 bit:
[["0xdce394502671a3472fa7ec41b0ab69963f39482d18f54287b5f366c04c74ce7e", "0x950459a3712bd78d35232a86c301013befb49c5c69db88e777157a6f82eb453c", "0xb9d4daec5a40a0e3d14ce54667dc2ce366369772f5c480e8ba8bde8c7f7c9f1b"], ["0x852bebc37319ba1a0f3bf452b36f67536db30705115943957394090444b9d1c7", "0x8efc83369b5d3c1fd4babb15f86cb72ec2ad335027d5be254a55c22c2922ee0c", "0x10415d67659ef1721de51ca3bb49d2c876069b3da864538f78805c822e3233a8"], ["0xdcfbb9ef5fa6a26abb29aae0a2a41ad8e5e10899b12b387fa3cdffe7e99dc530", "0x9491d52ddee21b79f140edeef94b82352d4bd46edea867cc1745f35e793a965f", "0x6d95d1cc02b662c55cc8dfdf5656f5ab7fc4488805130d7feb4fb6b3fd65ab7"], ["0x854ec7b688feca4735aebcf6d8c281b0b49bd031943de9d7ec4718d10f8ae3bc", "0xeec3dd6b212a5759f3389458d358bb37e6f5303dbf5e384aa386e6d7c84b39c9", "0xf7673185e083db8e54b7a5b83b545747d90fd1c2064fa1091d394d491ede0e45"], ["0xf7f90f3c03bd5c87fe76fefd2d91903faeaeb3119cae109378898c6fd744c00d", "0xf0281f25b1d67bb37740dc54582a275d6f7ecb51d09c7f4ab501f3da84bd75e8", "0xe141e76eb1630ed09f26c5690b5cff366acf73b09449fd532277baf6bd6804ac"], ["0x9d95a2ba18cdb6cf55e6c43696da0b32361f22a6941c3e45be634672d8392b6e", "0x63fbf92440443f326d20c51981b69b509d296d2f64fe198c276f7c77c4e83033", "0x2c74261400e10ce761dcefb1f2ff0b69c91a3afb9ec376bce14885ff901aa14d"], ["0xc3d602e432a47e5b79e7fb5d1d638f35031118f26c3fc1a2b1d2c1b3114f6d75", "0xa0e7fd384990c93802b1ba6fdbcd57da16bbc6c4a883a74e4e149624c5410728", "0xa8bb9b81d623bd16a1908367ae6d43c10c8e14df73d299c4195fb96285b500dc"], ["0xee3ccd41f20240905dec84e7a291e32527b054f2069327e4f1b965e4cad7dd26", "0xba357025970f308b424f3080c5529cb31dc6a030226f1f57b05ffb24c329ea7e", "0x3326ac504b004e16a2a646e3d4adbde07aea27a387ee674c2ed9eadfc4cf5376"], ["0x82022ec18e1f32a443d2f5938681fb9159013fb91f804378d5b96c1649f35dbf", "0xe7605b8db8138314c1c7d6c576d9557ed2a72bce5c9592654d134ff5c9e5d044", "0xf767efe06026b5142be7b80cc149d57606c814c74b65285127eb652c18c9aa0"], ["0xeda2005707df7793446995255c4087f5baa7792a1cbdb95b69a836a27438c888", "0x23c35f861a9726309713144c5f13898140b06905ebe2ecda675edb4ea80e998c", "0x9911c7e2a14c070e652c5d8de355039d9db7afcd33618bb0ba8e7bea37cedf99"]]
pubkey:
04a2e0e99ceac47a3dd83f33434523f09ba8b35b773c795fe1c5a370f1e73456e92fb40ba82f4ec 010bdb0800872656a9e1eef6d1627259850bea1671880c779bc
?
I'm running some unrelated tests now, it'll finish soon and i'll send it. if you can send the x and y of the public key it'll be good.
I made dec for pubkey later and send it.
The private key for the 230 bit public key is
1606810226048941903531730621352970454741442315642201293890991507745196
confirm:
print(0x3b99934a8858ffa79d9a6d7a7f3ba4c82ced80430118adfc885d45a9ac
try 256?
after 256 need check 256 with nonce <252
after after test or real data
so, time to go to "dark web anonimous" is little fare away ))
It works on real data as you seen.
I can confirm that i already did that on 256 bit keys and it works.
if you want we can chat privately, i don't want to make things too public on the internet.
If you know some advanced math DM me. but don't expect me to provide any tools or codes.
230 bit:
[["0xdce394502671a3472fa7ec41b0ab69963f39482d18f54287b5f366c04c74ce7e", "0x950459a3712bd78d35232a86c301013befb49c5c69db88e777157a6f82eb453c", "0xb9d4daec5a40a0e3d14ce54667dc2ce366369772f5c480e8ba8bde8c7f7c9f1b"], ["0x852bebc37319ba1a0f3bf452b36f67536db30705115943957394090444b9d1c7", "0x8efc83369b5d3c1fd4babb15f86cb72ec2ad335027d5be254a55c22c2922ee0c", "0x10415d67659ef1721de51ca3bb49d2c876069b3da864538f78805c822e3233a8"], ["0xdcfbb9ef5fa6a26abb29aae0a2a41ad8e5e10899b12b387fa3cdffe7e99dc530", "0x9491d52ddee21b79f140edeef94b82352d4bd46edea867cc1745f35e793a965f", "0x6d95d1cc02b662c55cc8dfdf5656f5ab7fc4488805130d7feb4fb6b3fd65ab7"], ["0x854ec7b688feca4735aebcf6d8c281b0b49bd031943de9d7ec4718d10f8ae3bc", "0xeec3dd6b212a5759f3389458d358bb37e6f5303dbf5e384aa386e6d7c84b39c9", "0xf7673185e083db8e54b7a5b83b545747d90fd1c2064fa1091d394d491ede0e45"], ["0xf7f90f3c03bd5c87fe76fefd2d91903faeaeb3119cae109378898c6fd744c00d", "0xf0281f25b1d67bb37740dc54582a275d6f7ecb51d09c7f4ab501f3da84bd75e8", "0xe141e76eb1630ed09f26c5690b5cff366acf73b09449fd532277baf6bd6804ac"], ["0x9d95a2ba18cdb6cf55e6c43696da0b32361f22a6941c3e45be634672d8392b6e", "0x63fbf92440443f326d20c51981b69b509d296d2f64fe198c276f7c77c4e83033", "0x2c74261400e10ce761dcefb1f2ff0b69c91a3afb9ec376bce14885ff901aa14d"], ["0xc3d602e432a47e5b79e7fb5d1d638f35031118f26c3fc1a2b1d2c1b3114f6d75", "0xa0e7fd384990c93802b1ba6fdbcd57da16bbc6c4a883a74e4e149624c5410728", "0xa8bb9b81d623bd16a1908367ae6d43c10c8e14df73d299c4195fb96285b500dc"], ["0xee3ccd41f20240905dec84e7a291e32527b054f2069327e4f1b965e4cad7dd26", "0xba357025970f308b424f3080c5529cb31dc6a030226f1f57b05ffb24c329ea7e", "0x3326ac504b004e16a2a646e3d4adbde07aea27a387ee674c2ed9eadfc4cf5376"], ["0x82022ec18e1f32a443d2f5938681fb9159013fb91f804378d5b96c1649f35dbf", "0xe7605b8db8138314c1c7d6c576d9557ed2a72bce5c9592654d134ff5c9e5d044", "0xf767efe06026b5142be7b80cc149d57606c814c74b65285127eb652c18c9aa0"], ["0xeda2005707df7793446995255c4087f5baa7792a1cbdb95b69a836a27438c888", "0x23c35f861a9726309713144c5f13898140b06905ebe2ecda675edb4ea80e998c", "0x9911c7e2a14c070e652c5d8de355039d9db7afcd33618bb0ba8e7bea37cedf99"]]
pubkey:
04a2e0e99ceac47a3dd83f33434523f09ba8b35b773c795fe1c5a370f1e73456e92fb40ba82f4ec 010bdb0800872656a9e1eef6d1627259850bea1671880c779bc
?
I'm running some unrelated tests now, it'll finish soon and i'll send it. if you can send the x and y of the public key it'll be good.
I made dec for pubkey later and send it.
The private key for the 230 bit public key is
1606810226048941903531730621352970454741442315642201293890991507745196
confirm:
print(0x3b99934a8858ffa79d9a6d7a7f3ba4c82ced80430118adfc885d45a9ac
try 256?
after 256 need check 256 with nonce <252
after after test or real data
so, time to go to "dark web anonimous" is little fare away ))
It works on real data as you seen.
I can confirm that i already did that on 256 bit keys and it works.
if you want we can chat privately, i don't want to make things too public on the internet.
If you know some advanced math DM me. but don't expect me to provide any tools or codes.
Hello. I would like to participate in your discussion with Cobras. I am very interested in what approach is in your script. I am going over in my head who you are in the original, I am really very interested.