Searching for K nonce

[dexizer7799]

Hi sir I want to try your code with these rsz
1:
r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
2:
r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
Can you help me with script to find private keys from these rsz.

These 2 sets of r,s,z   use different public keys...the private keys must also be different..
1:
0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd036413e

2:
0x000000000000000000000000000000000000000000000001a838b13505b26867

And for 1 rsz private key is

0000000000000000000000000000000000000000000000000000000000000003

it is puzzle 2

 

I can easily send to you rsz with unknown private key for you. How can we find that private key with this script?

[1715261391]

1715261391

[krashfire]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

[dexizer7799]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

[jacky19790729]

And for 1 rsz private key is
0000000000000000000000000000000000000000000000000000000000000003
it is puzzle 2
 
I can easily send to you rsz with unknown private key for you. How can we find that private key with this script?

0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd036413e
and
0x0000000000000000000000000000000000000000000000000000000000000003

use same X :  f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

https://blog.trailofbits.com/2020/06/11/ecdsa-handle-with-care/

It is still impossible to crack the private key from r s z unless the association of k nonce in multiple sets of r, s, z is known

[COBRAS]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

[bnm2610906]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

[COBRAS]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this


https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

[bnm2610906]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this


https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Am I changing it directly in kangaroo.py? If so, which paragraph should I change? I don't quite understand. Can I explain it in more detail, sir? Thank you very much for sharing. Thank you very much

[bnm2610906]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this


https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Traceback (most recent call last):
  File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 144, in <module>
    k = (z + i )%n # * modinv(s, n) % n #start range
NameError: name 'n' is not defined



This error will occur when I directly change the BSGS before running it again

[bnm2610906]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this


https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

raceback (most recent call last):
  File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 147, in <module>
    R = E.lift_x(Integer(r))
NameError: name 'E' is not defined


Oh, after adding n values to my sky, it turned out like this again

[COBRAS]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this


https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Am I changing it directly in kangaroo.py? If so, which paragraph should I change? I don't quite understand. Can I explain it in more detail, sir? Thank you very much for sharing. Thank you very much

i answer you in pm

[bnm2610906]

oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 

use Google .......so I find 2 private key from his 2 rsz
 

1:   
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1

Starting Program...
======================================================================
[Input Index #: 0]
     R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
     S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
     Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9

2:   puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc

Starting Program...
======================================================================
[Input Index #: 0]
     R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
     S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
     Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Ok but how can I find these rsz with this script very fast?

use this script https://github.com/iceland2k14/rsz to find rsz of a txid

I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.

This method for ex:

https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Mr Sir, I'm a newbie, I won't add this program to the kangaroo, how do I add it to the kangaroo, please? Do you have a GitHub program to share? Thank you

with this


https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187

Am I changing it directly in kangaroo.py? If so, which paragraph should I change? I don't quite understand. Can I explain it in more detail, sir? Thank you very much for sharing. Thank you very much

i answer you in pm

Okay thank you

[bnm2610906]

I had made a little change in my code. im just hoping i could receive some advice on whether my method here is more efficient or sound?

i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.

so my question is,

 please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?

and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,

please check my code to see where i can improve. thank you.

Code:

import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

Traceback (most recent call last):
  File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
    E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined

It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?

[COBRAS]

I had made a little change in my code. im just hoping i could receive some advice on whether my method here is more efficient or sound?

i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.

so my question is,

 please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?

and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,

please check my code to see where i can improve. thank you.

Code:

import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

Traceback (most recent call last):
  File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
    E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined

It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?

this is a SAGEMATH code, not python


and needs put r,s,z data to:

r=0x
s=0x
z=0x

[bnm2610906]

I had made a little change in my code. im just hoping i could receive some advice on whether my method here is more efficient or sound?

i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.

so my question is,

 please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?

and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,

please check my code to see where i can improve. thank you.

Code:

import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

Traceback (most recent call last):
  File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
    E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined

It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?

this is a SAGEMATH code, not python


and needs put r,s,z data to:

r=0x
s=0x
z=0x

Okay, thank you, how do I import it into BSGS?

[bnm2610906]

I had made a little change in my code. im just hoping i could receive some advice on whether my method here is more efficient or sound?

i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.

so my question is,

 please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?

and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,

please check my code to see where i can improve. thank you.

Code:

import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
           
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)

pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce

for i in range(1, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    K = k * G
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):
        print("Found real k:", k)
        break

Traceback (most recent call last):
  File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
    E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined

It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?

this is a SAGEMATH code, not python


and needs put r,s,z data to:

r=0x
s=0x
z=0x

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

I'd like to ask if I start with this line of code, and if so, which range value does it look like?

[bnm2610906]

Code:

import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

error again, I try remove error, same error:


k = ((r * i%n + z%n)%n * modinv(s, n) % n)%n
  File "sage/structure/element.pyx", line 1921, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13675)
  File "sage/structure/coerce.pyx", line 1167, in sage.structure.coerce.CoercionModel_cache_maps.bin_op (build/cythonized/sage/structure/coerce.c:9612)
  File "sage/structure/element.pyx", line 1919, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13640)
  File "sage/structure/element.pyx", line 1954, in sage.structure.element.Element._mod_ (build/cythonized/sage/structure/element.c:13933)
TypeError: unsupported operand parent(s) for %: 'Symbolic Ring' and 'Symbolic Ring'

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


?

I have a question that I'm curious about, is it possible to use all RSZs, is there a fix for this program, is it a fix for pubkey, or is it something else ...

[COBRAS]

Code:

import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

error again, I try remove error, same error:


k = ((r * i%n + z%n)%n * modinv(s, n) % n)%n
  File "sage/structure/element.pyx", line 1921, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13675)
  File "sage/structure/coerce.pyx", line 1167, in sage.structure.coerce.CoercionModel_cache_maps.bin_op (build/cythonized/sage/structure/coerce.c:9612)
  File "sage/structure/element.pyx", line 1919, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13640)
  File "sage/structure/element.pyx", line 1954, in sage.structure.element.Element._mod_ (build/cythonized/sage/structure/element.c:13933)
TypeError: unsupported operand parent(s) for %: 'Symbolic Ring' and 'Symbolic Ring'

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


?

I have a question that I'm curious about, is it possible to use all RSZs, is there a fix for this program, is it a fix for pubkey, or is it something else ...

check your pm

[dexizer7799]

Code:

import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

E = EllipticCurve(GF(p), [0, 7])

G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8))   # Base point

r=0x
s=0x
z=0x

def egcd(a, b):

    if a == 0:

        return (b, 0, 1)

    else:

        g, y, x = egcd(b % a, a)

        return (g, x - (b // a) * y, y)
def modinv(a, m):

    g, x, y = egcd(a, m)

    if g != 1:

        raise Exception('modular inverse does not exist')

    else:

        return x % m
def make_public(r,s,z):
    R = E.lift_x(Integer(r))
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    #R=u1*G + u2*public_key
    #pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
    u_n2=modinv(u2,n)%n
    u_n1=- u1*modinv(u2,n)%n
    
    pub=u_n1*G + u_n2*R
    pub2=u_n1*G + u_n2*(-R)
    return pub,pub2

def verify(r, s,z,public_key):
    w = int(modinv(s, n))
    u1 = int((z * w) % n)
    u2 = int((r * w) % n)
    D=u1*G + u2*public_key
    x,y=D.xy()
    x=int(x)

    if (r % n) == (x % n):
        print( "signature matches")
         
    else:
        print("invalid signature")
        
def calc_u(r,s,z):
    mod_s= modinv(s,n)%n
    u1=mod_s*z%n
    u2=mod_s*r%n
    print("u1==",u1,"n-u1=",n-u1)
    print("u2==",u2,"n-u2=",n-u2)
    return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)

print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()

# Find the real mod n for k and K nonce
# Loop to search for k in hexadecimal
for i in range(0, n):
    k = (r * i + z) * modinv(s, n) % n
    R = E.lift_x(Integer(r))
    P = k * G
    print("K:", hex(P.xy()[0]))  # Print the x-coordinate of K in hexadecimal
    if hex(P.xy()[0]) == hex(r):
        print("Found real k:", hex(P.xy()[0]))  # Print the real k in hexadecimal
        break

i just updated the code in sagemath.

error again, I try remove error, same error:


k = ((r * i%n + z%n)%n * modinv(s, n) % n)%n
  File "sage/structure/element.pyx", line 1921, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13675)
  File "sage/structure/coerce.pyx", line 1167, in sage.structure.coerce.CoercionModel_cache_maps.bin_op (build/cythonized/sage/structure/coerce.c:9612)
  File "sage/structure/element.pyx", line 1919, in sage.structure.element.Element.__mod__ (build/cythonized/sage/structure/element.c:13640)
  File "sage/structure/element.pyx", line 1954, in sage.structure.element.Element._mod_ (build/cythonized/sage/structure/element.c:13933)
TypeError: unsupported operand parent(s) for %: 'Symbolic Ring' and 'Symbolic Ring'

that's impossible. Have you insert your rsz? I did with 3 different sets of rsz. The signature verified. And the code works.

im use this rsz bro:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


?

I have a question that I'm curious about, is it possible to use all RSZs, is there a fix for this program, is it a fix for pubkey, or is it something else ...

check your pm

Hi you can share the script of kangaroo and bsgs with this method for all not only one.

[COBRAS]

Bsgs work example:


xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff

• Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
• Mode BSGS sequential
• Opening file addresses.txt
• Added 1 points from file
• Range
• -- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
• -- to   : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
• N = 0x100000000000
• Bloom filter for 4194304 elements : 14.38 MB
• Bloom filter for 131072 elements : 0.88 MB
• Bloom filter for 4096 elements : 0.88 MB
• Allocating 0.00 MB for 4096 bP Points
• processing 3145728/4194304 bP points : 7
• processing 4194304/4194304 bP points : 100%
• Making checkums .. ... done
• Sorting 4096 elements... Done!
• Thread 0xffd8e700c03997d8c19f5c793fed42f
• Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
• Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

All points were found