Author

Topic: Searching for K nonce (Read 1140 times)

member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
June 25, 2024, 01:12:51 AM
#83
Hi

Is it worth to brute force the K nonce?
How fast is it? Is it faster than bsgs mode?
no thats slower. bsgs is better.
newbie
Activity: 1
Merit: 0
June 25, 2024, 01:06:00 AM
#82
Hi

Is it worth to brute force the K nonce?
How fast is it? Is it faster than bsgs mode?
newbie
Activity: 14
Merit: 0
April 24, 2024, 09:26:25 AM
#81
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)



this data for YOUR RSZ !!! MISTER

('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))(
'BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning:
https://trac.sagemath.org/26756
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))(
'BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')









Can you share your BP looking script to get the basis point of the RSZ directly, because I use it for other RSZs and it doesn't work for this base point
jr. member
Activity: 31
Merit: 5
April 24, 2024, 08:49:35 AM
#80
noob question.

how do you calculate stride?

is there a script for it or more explanation on how it can be calculated?

looks like stride is the r signature. 
jr. member
Activity: 31
Merit: 5
April 24, 2024, 08:43:05 AM
#79
noob question.

how do you calculate stride?

is there a script for it or more explanation on how it can be calculated?
newbie
Activity: 14
Merit: 0
April 24, 2024, 02:08:16 AM
#78
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)



this data for YOUR RSZ !!! MISTER







Sir, this is my RSZ. How do I use which software to calculate these

member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 24, 2024, 01:49:14 AM
#77
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)



this data for YOUR RSZ !!! MISTER
newbie
Activity: 30
Merit: 0
April 24, 2024, 01:46:49 AM
#76
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:


range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886  (convert x,y of point and stride  to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)

for test data range file is

Quote
0
3b9945998c2beab84a78df7e3845f7eefee46fe51a80dd70d1085f8874bf7adc1e51dc00
04f506b4d016be6c4aea174688abd4da240d665f3aac6c031be381dfd808de12724d0be07a03152 6d994e1e79708d67dfef8e25257b48a87fa138d16e5c1a1701c

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?



publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?


02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

Ok I understand it and what about my rsz how can I get public keys of these rsz, formula script?

As I understand R is our public key and Z our k Nonce range?
newbie
Activity: 30
Merit: 0
April 24, 2024, 01:42:45 AM
#75
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:


range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886  (convert x,y of point and stride  to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)

for test data range file is

Quote
0
3b9945998c2beab84a78df7e3845f7eefee46fe51a80dd70d1085f8874bf7adc1e51dc00
04f506b4d016be6c4aea174688abd4da240d665f3aac6c031be381dfd808de12724d0be07a03152 6d994e1e79708d67dfef8e25257b48a87fa138d16e5c1a1701c

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?



publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?


02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

Ok I understand it and what about my rsz how can I get public keys of these rsz, formula script?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 24, 2024, 01:39:19 AM
#74
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:


range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886  (convert x,y of point and stride  to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)

for test data range file is

Quote
0
3b9945998c2beab84a78df7e3845f7eefee46fe51a80dd70d1085f8874bf7adc1e51dc00
04f506b4d016be6c4aea174688abd4da240d665f3aac6c031be381dfd808de12724d0be07a03152 6d994e1e79708d67dfef8e25257b48a87fa138d16e5c1a1701c

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?



publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?


02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012
newbie
Activity: 30
Merit: 0
April 24, 2024, 01:38:01 AM
#73
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:


range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886  (convert x,y of point and stride  to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)

for test data range file is

Quote
0
3b9945998c2beab84a78df7e3845f7eefee46fe51a80dd70d1085f8874bf7adc1e51dc00
04f506b4d016be6c4aea174688abd4da240d665f3aac6c031be381dfd808de12724d0be07a03152 6d994e1e79708d67dfef8e25257b48a87fa138d16e5c1a1701c

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?



publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else

Ok sir how can I get pubkey of k nonce?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 24, 2024, 01:32:58 AM
#72
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:


range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886  (convert x,y of point and stride  to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)

for test data range file is

Quote
0
3b9945998c2beab84a78df7e3845f7eefee46fe51a80dd70d1085f8874bf7adc1e51dc00
04f506b4d016be6c4aea174688abd4da240d665f3aac6c031be381dfd808de12724d0be07a03152 6d994e1e79708d67dfef8e25257b48a87fa138d16e5c1a1701c

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?



publey will be:

02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012

stride and range I think you can multiply and convert to hex without verification of someone else
newbie
Activity: 30
Merit: 0
April 24, 2024, 01:23:24 AM
#71
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:


range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886  (convert x,y of point and stride  to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)

for test data range file is

Quote
0
3b9945998c2beab84a78df7e3845f7eefee46fe51a80dd70d1085f8874bf7adc1e51dc00
04f506b4d016be6c4aea174688abd4da240d665f3aac6c031be381dfd808de12724d0be07a03152 6d994e1e79708d67dfef8e25257b48a87fa138d16e5c1a1701c

And for script

./kangaroo -stride fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 testBig.txt

Am I right?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 24, 2024, 01:17:00 AM
#70
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,

try first with my test data:


range will be from 0 to 115780575977492633039504758427830329241728645270042306223540962614150928364886 * 1000000000

stride
115780575977492633039504758427830329241728645270042306223540962614150928364886  (convert x,y of point and stride  to hex, and replace base point coordinate in code, this way you make more usefull wiork) after you learn how to go to yours rsz. And use compressed publick key

('PUBKEY', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556', 'r %n:', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)
newbie
Activity: 30
Merit: 0
April 24, 2024, 01:07:43 AM
#69
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt

Sir I need your help can you send me range file and stride for 1 rsz ,
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 24, 2024, 12:55:54 AM
#68
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672


you replace base point ?


you need a range in file testBig.txt
newbie
Activity: 30
Merit: 0
April 24, 2024, 12:34:32 AM
#67
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)


for first rsz I got this message

Error: testBig.txt not enough arguments

./kangaroo -stride 057a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748 testBig.txt

testBig.txt

Quote
0a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
04f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9388f7b0f632de 8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 24, 2024, 12:17:11 AM
#66
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.


for first raz:

('PUBKEY', (79620838012756598827828130617579362322313625350101718951233333703617136979605 : 33657541030782028211339269900859006449066718362917618846845071052689077797257 : 1))
('K(pubkey)', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))
('BP', (95752220693463853639262819544408648984687589768875954225478933468907694176261 : 10487468335696422502417672469117660265830581325971892122660931852310233092582 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.

('BP*i', (76165638660051562131761889771669377750079614690387842812129928154148832722371 : 62320520881158272740890786725239675672176865512810431270188168054292671803764 : 1))

('stride', 39641668997020200429758478738657078973416734677473442226277178491190842541896

('start range', 73951774784711041756344107340096161242141855163685503186937601045185491557024)


second:

('PUBKEY', (31522484613695558627929971220693585138599758317382686297776167844044648715632 : 1386318354567634595005371322015470729499114675202690435234998956615629641412 : 1))
('K(pubkey)', (114613476193930681127921653702732511670792748588448080987690924671524260883412 : 3103788442114383626988731829546210804301133170084957044889823747671638067496 : 1))
('BP', (48553103369484530258906285999579568812349361694156292650431923113073329502354 : 8525919006077427017673642311458669645874103019275259622853592532814859577126 : 1))

('stride', 140458473566915333680198867667020013824987463806873086903103037078123571178,


('start range', 53580508885810705110195044718774878464744482037286884842892521200781157326762)
newbie
Activity: 30
Merit: 0
April 24, 2024, 12:06:49 AM
#65
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?

Hi sir these are rsz

1:

r = 0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
s = 0x5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
z = 0xa37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0

2:

r = 0x4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
s = 0x430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
z = 0x76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa

How can I calculate these for that software I use that software.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 11:49:01 PM
#64
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get stride parameter example this af820335d9b3d9cf58b911d87035677fb7f528100000000

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748


provide your rsz i giive you data of stride, base point and publick


you try this soft

https://bitcointalksearch.org/topic/--5315607


with my test data and stride ?
newbie
Activity: 30
Merit: 0
April 23, 2024, 11:47:24 PM
#63
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help

Hi sir I have one problem with that software how I must get range example this

I need to get for this R

0x57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 03:35:28 PM
#62
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?


no way, stride may help
newbie
Activity: 30
Merit: 0
April 23, 2024, 02:57:19 PM
#61
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607

How to construct right range nonce? I tried it with kangaroo and it works perfectly but what about another R from rsz how to construct range nonce?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 02:33:24 PM
#60
@299006


use this soft, not bsgs alberto


https://bitcointalksearch.org/topic/--5315607
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 01:42:27 PM
#59
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz

Bro,  for keyhunt you need replace a base point too.


this data for brute in kangaroo or BSGS:

.BP is a base point:


('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)
yes!!!
('Found real k:', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'i', 'i%n', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'hex i%n', 'ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979bf')
('Match found for u1 at i =', 0)
('!!!', 0, 0)
('Matches found for u values:', [('u1', 0)])
xman@localhost:~$


Replace data of base point is file

keyhunt/secp256k1$

SECP256K1.cpp


this strings of base point data:(in this example I am already put data of my base pooint:

// Generator point and order
  G.x.SetBase16("a0d287fb17a25850106cc52227......
  G.y.SetBase16("4df036d34f3bdab912371941cc.......
  G.z.SetInt32(1);
  order.SetBase16


and use with stride


but, keyhunt bad work for me with stride,and I have no vast.ai account now for try stride with this software what has a good stride:

https://bitcointalksearch.org/topic/--5315607


try this with my data and stride.... looks what will be work or not


Bro, if you have any qeschions - you are welcome.

p.s. i in my scrypt and your scrypt are equal !


Br











The cardinal point is not X Y of the public key? Huh



this is a publick for bsgs


('K(pubkey)', (X -110828496909695470428991951019511777919675897427067199301138456851743189635698 : Y -34849073939243886814396770061608715653288911484439836598749957952410646310940 ))
newbie
Activity: 14
Merit: 0
April 23, 2024, 12:39:48 PM
#58
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz

Bro,  for keyhunt you need replace a base point too.


this data for brute in kangaroo or BSGS:

.BP is a base point:


('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)
yes!!!
('Found real k:', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'i', 'i%n', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'hex i%n', 'ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979bf')
('Match found for u1 at i =', 0)
('!!!', 0, 0)
('Matches found for u values:', [('u1', 0)])
xman@localhost:~$


Replace data of base point is file

keyhunt/secp256k1$

SECP256K1.cpp


this strings of base point data:(in this example I am already put data of my base pooint:

// Generator point and order
  G.x.SetBase16("a0d287fb17a25850106cc52227......
  G.y.SetBase16("4df036d34f3bdab912371941cc.......
  G.z.SetInt32(1);
  order.SetBase16


and use with stride


but, keyhunt bad work for me with stride,and I have no vast.ai account now for try stride with this software what has a good stride:

https://bitcointalksearch.org/topic/--5315607


try this with my data and stride.... looks what will be work or not


Bro, if you have any qeschions - you are welcome.

p.s. i in my scrypt and your scrypt are equal !


Br











The cardinal point is not X Y of the public key? Huh
newbie
Activity: 14
Merit: 0
April 23, 2024, 12:33:44 PM
#57
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz

Bro,  for keyhunt you need replace a base point too.


this data for brute in kangaroo or BSGS:

.BP is a base point:


('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)
yes!!!
('Found real k:', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'i', 'i%n', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'hex i%n', 'ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979bf')
('Match found for u1 at i =', 0)
('!!!', 0, 0)
('Matches found for u values:', [('u1', 0)])
xman@localhost:~$


Replace data of base point is file

keyhunt/secp256k1$

SECP256K1.cpp


this strings of base point data:(in this example I am already put data of my base pooint:

// Generator point and order
  G.x.SetBase16("a0d287fb17a25850106cc52227......
  G.y.SetBase16("4df036d34f3bdab912371941cc.......
  G.z.SetInt32(1);
  order.SetBase16


and use with stride


but, keyhunt bad work for me with stride,and I have no vast.ai account now for try stride with this software what has a good stride:

https://bitcointalksearch.org/topic/--5315607


try this with my data and stride.... looks what will be work or not


Bro, if you have any qeschions - you are welcome.

p.s. i in my scrypt and your scrypt are equal !


Br











If I were to use
krashfire's code instead of your bsgs Is it also necessary to replace the base point? If you use the code provided by krashfire So what do I need to replace my base point with? Can you elaborate on that?




member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 11:12:20 AM
#56
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz

check pm...
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 10:47:47 AM
#55
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz

Bro,  for keyhunt you need replace a base point too.


this data for brute in kangaroo or BSGS:

.BP is a base point:


('K(pubkey)', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP', (72742032162118480585933344979617114227426107059606997208268050083726572592328 : 35252511027654091311316081050016893461309059670017896859124791030125997564641 : 1))
sys:1: DeprecationWarning: use the method .hex instead
See https://trac.sagemath.org/26756 for details.
('BP x', 'a0d287fb17a25850106cc52227b69e4680341289f4da0500c0467ba65f131cc8')
('BP y', '4df036d34f3bdab912371941cc0d407d43f336c6e2b97edb05e1649ce207a2e1')
('BP*i', (110828496909695470428991951019511777919675897427067199301138456851743189635698 : 34849073939243886814396770061608715653288911484439836598749957952410646310940 : 1))
('BP * I X', '396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012')
('BP * I Y', 'c58e2c437831fb46ac58a340d5038dd096c4f0b4d7c015f092c68409e9232c12')
('stride', 115780575977492633039504758427830329241728645270042306223540962614150928364886, 'hex r', 'fff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556')
('start range', 0)
yes!!!
('Found real k:', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'i', 'i%n', 115723009678374821119173625523542436186184050224879315428219959977314762717631, 'hex i%n', 'ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979bf')
('Match found for u1 at i =', 0)
('!!!', 0, 0)
('Matches found for u values:', [('u1', 0)])
xman@localhost:~$


Replace data of base point is file

keyhunt/secp256k1$

SECP256K1.cpp


this strings of base point data:(in this example I am already put data of my base pooint:

// Generator point and order
  G.x.SetBase16("a0d287fb17a25850106cc52227......
  G.y.SetBase16("4df036d34f3bdab912371941cc.......
  G.z.SetInt32(1);
  order.SetBase16


and use with stride


but, keyhunt bad work for me with stride,and I have no vast.ai account now for try stride with this software what has a good stride:

https://bitcointalksearch.org/topic/--5315607


try this with my data and stride.... looks what will be work or not


Bro, if you have any qeschions - you are welcome.

p.s. i in my scrypt and your scrypt are equal !


Br







newbie
Activity: 14
Merit: 0
April 23, 2024, 09:51:43 AM
#54
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz









      "vout": 0,
      "scriptSig": {
        "asm": "[ALL] ,
        "hex": "
      "sequence": 123456
    }
  ],
  "vout": [
    {
      "value": ,
      "n": 0,
      "scriptPubKey": {
        "asm": "OP_DUP OP_HASH160 7xxxxxxxxxxx OP_EQUALVERIFY OP_CHECKSIG",
        "desc": "addr()#at0lenfa",
        "hex": "7",
        "address": "",
        "type": "pubkeyhash"
      }
    },
    {
      "value": ,
      "n": 1,
      "scriptPubKey": {
        "asm": "0465d00xxx95dc8 OP_CHECKSIG",
        "desc": "5d005eedc8)#4my4cmnu",
        "hex": "4295bdf1aef6846xxxdc8ac",
        "type": "pubkey"




This is a rough hash of the transaction, I deleted it, if this is the case, can you use your code and enter the R S Z of this transaction to run it in 6 weeks









newbie
Activity: 14
Merit: 0
April 23, 2024, 09:44:17 AM
#53
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz


Hello sir, I used your code, but it doesn't come out at the moment, it's a 2009 wallet transaction address, the output hash value, the last paragraph is pubkey, the above paragraph is pubkeyhasha, can you use your code to run out of the private key?
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 23, 2024, 09:10:42 AM
#52
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


hey bro... i had use z signature as the start range. it dont work on the keyhunt programme. its taking awhile.

Anyways, i saw some of you looking how to get the r,s,z signatures, you can just clone the program from here https://github.com/iceland2k14/rsz
newbie
Activity: 30
Merit: 0
April 23, 2024, 08:03:01 AM
#51
Ok if it works can you share for all us.
newbie
Activity: 14
Merit: 0
April 23, 2024, 07:15:16 AM
#50
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2

Brother, I don't know if you use calculus, please, can you write a script that goes straight into RSZ, and he'll figure out what should be there and run it automatically, please, you're my God
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 23, 2024, 06:32:41 AM
#49
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take  range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....


kangroo for ex example never stop and give good speed, so maybe.


bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.


Br





start of search range is always Z signature?

yes !  I spend some time for make start range 0, moving z to enother part of formula. For mo understanding look to formula with i = 0 I think you understand why z is a start  Wink ...I was understand this using this way




ok i try with different r,s,z. thanks.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 05:52:46 AM
#48
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


this result for this rsz:


r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2
newbie
Activity: 14
Merit: 0
April 23, 2024, 05:45:14 AM
#47
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take  range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....


kangroo for ex example never stop and give good speed, so maybe.


bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.


Br





start of search range is always Z signature?

yes !  I spend some time for make start range 0, moving z to enother part of formula. For mo understanding look to formula with i = 0 I think you understand why z is a start  Wink ...I was understand this using this way


Br


Stride length has always been this 0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 Or is it what formula did you use to find your stride length It is impossible for other addresses to be this stride length Huh


no, straid is from calculus. of r,s,z  Wink

Open the addresses.txt in the file, where did you get it? take the public key below txid R S Z? and start the range and select Z directly?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 05:17:39 AM
#46
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take  range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....


kangroo for ex example never stop and give good speed, so maybe.


bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.


Br





start of search range is always Z signature?

yes !  I spend some time for make start range 0, moving z to enother part of formula. For mo understanding look to formula with i = 0 I think you understand why z is a start  Wink ...I was understand this using this way


Br


Stride length has always been this 0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 Or is it what formula did you use to find your stride length It is impossible for other addresses to be this stride length Huh


no, straid is from calculus. of r,s,z  Wink
newbie
Activity: 14
Merit: 0
April 23, 2024, 05:13:58 AM
#45
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take  range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....


kangroo for ex example never stop and give good speed, so maybe.


bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.


Br





start of search range is always Z signature?

yes !  I spend some time for make start range 0, moving z to enother part of formula. For mo understanding look to formula with i = 0 I think you understand why z is a start  Wink ...I was understand this using this way


Br


Stride length has always been this 0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556 Or is it what formula did you use to find your stride length It is impossible for other addresses to be this stride length Huh
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 04:02:43 AM
#44
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take  range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....


kangroo for ex example never stop and give good speed, so maybe.


bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.


Br





start of search range is always Z signature?

yes !  I spend some time for make start range 0, moving z to enother part of formula. For mo understanding look to formula with i = 0 I think you understand why z is a start  Wink ...I was understand this using this way


Br
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 23, 2024, 03:59:08 AM
#43
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take  range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....


kangroo for ex example never stop and give good speed, so maybe.


bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.


Br





start of search range is always Z signature?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 03:54:49 AM
#42
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.

Bro I know stride, this is theoreticaly simplify task, but I continue wok on it

stride example:

0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556

so, for take  range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....


kangroo for ex example never stop and give good speed, so maybe....


bro, start of search range is always z , in my formulas what I make from your srypt. I think you find a nonce what bigger then z , too.


Br


xpoint work bad for me now, maybe I do something wrsng:


same task, no resilt yet:


./keyhunt -m xpoint -r 0:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe9ffff -I 0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556
  • Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
  • Mode xpoint
  • Stride : 115780575977492633039504758427830329241728645270042306223540962614150928364886
  • N = 0x100000000
  • Range
  • -- from : 0x1
  • -- to   : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe9ffff
  • Allocating memory for 1 elements: 0.00 MB
  • Bloom filter for 1 elements.
  • Loading data to the bloomfilter total: 0.03 MB


member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 23, 2024, 02:54:16 AM
#41
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

But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 23, 2024, 01:36:36 AM
#40
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
newbie
Activity: 30
Merit: 0
April 22, 2024, 08:26:56 AM
#39
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.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 21, 2024, 06:43:29 PM
#38
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
newbie
Activity: 14
Merit: 0
April 21, 2024, 10:24:28 AM
#37
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 ...
newbie
Activity: 14
Merit: 0
April 21, 2024, 06:26:25 AM
#36
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
    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?
newbie
Activity: 14
Merit: 0
April 21, 2024, 05:56:04 AM
#35
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
    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?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 21, 2024, 05:44:04 AM
#34
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
    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
newbie
Activity: 14
Merit: 0
April 21, 2024, 04:29:45 AM
#33
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
    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?

newbie
Activity: 14
Merit: 0
April 21, 2024, 01:42:09 AM
#32
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
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://bitcointalksearch.org/topic/m.63946187
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
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 20, 2024, 06:27:46 PM
#31
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
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://bitcointalksearch.org/topic/m.63946187
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
newbie
Activity: 14
Merit: 0
April 20, 2024, 05:55:44 PM
#30
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
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://bitcointalksearch.org/topic/m.63946187


raceback (most recent call last):
  File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 147, in
    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
newbie
Activity: 14
Merit: 0
April 20, 2024, 05:47:28 PM
#29
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
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://bitcointalksearch.org/topic/m.63946187


Traceback (most recent call last):
  File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 144, in
    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




newbie
Activity: 14
Merit: 0
April 20, 2024, 05:29:59 PM
#28
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
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://bitcointalksearch.org/topic/m.63946187
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
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 20, 2024, 05:10:59 PM
#27
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
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://bitcointalksearch.org/topic/m.63946187
newbie
Activity: 14
Merit: 0
April 20, 2024, 03:41:00 PM
#26
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
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
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 18, 2024, 04:22:49 PM
#25
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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://bitcointalksearch.org/topic/m.63946187
jr. member
Activity: 82
Merit: 8
April 18, 2024, 11:52:26 AM
#24
And for 1 rsz private key is
0000000000000000000000000000000000000000000000000000000000000003
it is puzzle 2
 Grin
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
newbie
Activity: 30
Merit: 0
April 18, 2024, 11:45:01 AM
#23
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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.
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 18, 2024, 11:42:19 AM
#22
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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
newbie
Activity: 30
Merit: 0
April 18, 2024, 11:38:41 AM
#21
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

 Grin

I can easily send to you rsz with unknown private key for you. How can we find that private key with this script?
newbie
Activity: 30
Merit: 0
April 18, 2024, 11:29:36 AM
#20
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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?
jr. member
Activity: 82
Merit: 8
April 18, 2024, 11:27:45 AM
#19
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
 Grin Grin

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
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 18, 2024, 11:14:41 AM
#18
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



oh f-k, you really find privkeys?

you use kangaroo multy gpu from GL or keyhunt ?


 Grin Grin
jr. member
Activity: 82
Merit: 8
April 18, 2024, 11:06:26 AM
#17
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
newbie
Activity: 30
Merit: 0
April 18, 2024, 09:26:38 AM
#16
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


?
lol. of course that wont work. its not real rsz

why this not work ?


replace base pooint and "i" in cangaroo and you take "i" were finder k,after put "i" to your formula....

Huh


this is work, jast enother way of using cangaroo and bsgs search

try with your real 6 weeks search rsz, and tall what time was need to find k with cuda bsgs or cuda kangaroo ?

thx

ps this is work, bro Wink

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.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 16, 2024, 08:13:45 PM
#15
@Krashfire,  do you have any new findings ?
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 15, 2024, 07:51:59 AM
#14
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


?
lol. of course that wont work. its not real rsz

why this not work ?


replace base pooint and "i" in cangaroo and you take "i" were finder k,after put "i" to your formula....

Huh


this is work, jast enother way of using cangaroo and bsgs search

try with your real 6 weeks search rsz, and tall what time was need to find k with cuda bsgs or cuda kangaroo ?

thx

ps this is work, bro Wink
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 15, 2024, 03:40:06 AM
#13
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


?
lol. of course that wont work. its not real rsz
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 14, 2024, 08:13:49 PM
#12
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.


little example how to  add your code to bsgs or kangaroo software:


r= 1157805759774926330395047584278303292417$
s= 1157844137307671538341935006214495221120$
z= 2

i = 0


while True:
    k = (z + i )%n # * modinv(s, n) % n #start range
    print("k",k)
    R = E.lift_x(Integer(r))
    K = k * ( modinv(s, n) * G) #( modinv(s, n) * G) - base point
    u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
#if k <=2**100:print("$$$",k,i)
    if K == (u1 * G + u2 * R): # in () is a pubkey
        print("&",k)
        print("yes!!!")
        print("Found real k:", k,i)
        break

    i = i +  r




('Found real k:', 115723009678374821119173625523542436186184050224879315428219959977314762717633, 69468345586495579823702855056698197545037187162025383734124577568490557018931


Huh


enjoy ))
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 14, 2024, 12:43:31 AM
#11
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 put this part:

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


and put to your code  of your presious thread, working.

('Found real k:', 87069027473077907962879272067307854440257155754636880132689937952837782290998, 6)
('Match found for u1 at i =', 0)
('!!!', 6, 4)


but ecdsa123 tell what nonce is 6, not  87069027473077907962879272067307854440257155754636880132689937952837782290998
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 13, 2024, 09:25:35 PM
#10
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


?
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 13, 2024, 08:47:50 PM
#9
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.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 13, 2024, 12:55:51 PM
#8
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'
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 13, 2024, 05:43:22 AM
#7
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.


bro, test your code at this test data, I try you scrypt from your orevious topic not found k !


this test data from ecdsa123:



r= 115780575977492633039504758427830329241728645270042306223540962614150928364886
s= 115784413730767153834193500621449522112098284939719838943229029456606672741370
z= 2


k = 6
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 13, 2024, 12:21:04 AM
#6
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.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 12, 2024, 05:58:14 PM
#5
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=0x00fc5e2ab560be4649b85511940daf8302cf2e2e06bfd60a75c8bae5f832da289c
s=0x45c4c9d548699bbc5f3484a2d6d59ac07ea3328a1deb6b2bb9f2f8f0727be1de
z=0x6559f4e4b8d7824a641418b992f913411a1995fa35668c8c634b5a19a93a944c

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




Krashfire,


 u1 = (modinv(s, n) * z) % n
    u2 = (modinv(s, n) * r) % n
    if K == (u1 * G + u2 * R):



u1, u2 are known. What a problem find u1*G +u2*R ?

u2 * R is a number? How you add number to point u1*G ?

br
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 12, 2024, 03:57:15 PM
#4
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=0x00fc5e2ab560be4649b85511940daf8302cf2e2e06bfd60a75c8bae5f832da289c
s=0x45c4c9d548699bbc5f3484a2d6d59ac07ea3328a1deb6b2bb9f2f8f0727be1de
z=0x6559f4e4b8d7824a641418b992f913411a1995fa35668c8c634b5a19a93a944c

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




I take error:

line 12
SyntaxError: Non-ASCII character '\xc2' in file nonce9.sage.py on line 12, but no encoding declared; see http://python.org/dev/peps/pep-0263/ for details
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
April 12, 2024, 11:16:19 AM
#3
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=0x00fc5e2ab560be4649b85511940daf8302cf2e2e06bfd60a75c8bae5f832da289c
s=0x45c4c9d548699bbc5f3484a2d6d59ac07ea3328a1deb6b2bb9f2f8f0727be1de
z=0x6559f4e4b8d7824a641418b992f913411a1995fa35668c8c634b5a19a93a944c

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




great , I will try
member
Activity: 69
Merit: 53
April 12, 2024, 04:45:48 AM
#2
Hi
This is my version if you have private key or may need to bf.
Code:
def Get_Nonce_K_With_Private_Key(r,s,z,x):
if (x == 0 ):
return 0;
sinv = pow(s,N-2,N)
t1 = (x*r) % N
t2 = (z+t1) % N
myK = (sinv*t2) % N
if (myK == 0 ):
return 0;
if ((myK*G).x.num == r):
return myK
return 0

But you can always do R == K * G to find out if you really found valid K or not.

Regards,
member
Activity: 127
Merit: 14
Life aint interesting without any cuts and bruises
April 12, 2024, 03:49:21 AM
#1
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


Jump to: