Search content
Sort by
Showing 20 of 21 results by bnm2610906
K: 57693594628803274708875609257689291793313896681711523793281764510965395518430
K (hex): 0x7f8d6ad886348454c238ca49ef01c7fde83925372c414e9e98827ea204ae73de
K MSB: 01111111100011010110101011011000
K LSB: 00000100101011100111001111011110
r: 0x44022028cf3771072718602a8157c92b7d905c194ba38045a6177a06fd3dc362
s: 0x38a60220520b4b1d36d55070419e21c1d0b47511d96477bbea459202ad3aa2e7
z: 0xb9354ccf66a361b618f067f6c1244f1495776d7cb095be0ac1e86d0992d79cdd
Script: 473044022028cf3771072718602a8157c92b7d905c194ba38045a6177a06fd3dc362e738a602205 20b4b1d36d55070419e21c1d0b47511d96477bbea459202ad3aa2e72231e6c501210321369b6c05 4bf52f4f21091f1bebe71c8da184ef75d88b45a2f463bdf5f162af
K: 41134620020427918509232437735715264323869950887026447086088473267917728820592
K (hex): 0x5af15eafdc0f849634732c16028047bc43358f6c16207fc2bf1fac8faaf0ad70
K MSB: 01011010111100010101111010101111
K LSB: 10101010111100001010110101110000
r: 0xabe9088f1c430549d33070c4343d83b68fc6b7f798b778d3466126303eea4861
s: 0x2d23b76fe88bcfb2674feb500d56cb5603957d25b21dfadedd4d029cf9d35b8b
z: 0xb9354ccf66a361b618f067f6c1244f1495776d7cb095be0ac1e86d0992d79cdd
Script: 483045022100abe9088f1c430549d33070c4343d83b68fc6b7f798b778d3466126303eea4861022 02d23b76fe88bcfb2674feb500d56cb5603957d25b21dfadedd4d029cf9d35b8b01210321369b6c 054bf52f4f21091f1bebe71c8da184ef75d88b45a2f463bdf5f162af
K: 57812917839694142708293111517794561297960475000280608277966594035734982329126
K(hex): 0x7fd0f3b066dc682f38a391f58c560f4e3caba5f2e37d3803ca837e682dfa8326
K MSB: 01111111110100001111001110110000
K LSB: 00101101111110101000001100100110
r: 0x4402200bfde30fc1a4a05a263aefa1627eea9c4649ca5c445648a7f33de43b68
s: 0xb34e0220639938ce29ab4a32d8d518ee893c96e79c582c7fe916282868ec1783
z: 0xb9354ccf66a361b618f067f6c1244f1495776d7cb095be0ac1e86d0992d79cdd
Script: 47304402200bfde30fc1a4a05a263aefa1627eea9c4649ca5c445648a7f33de43b68afb34e02206 39938ce29ab4a32d8d518ee893c96e79c582c7fe916282868ec1783ac9afef101210321369b6c05 4bf52f4f21091f1bebe71c8da184ef75d88b45a2f463bdf5f162af
I found a duplicate Z-value Does this help with recovery I don't understand very well I used RSZK to restore the private key will become 1 Does this have anything to do with lattice attack?
K (hex): 0x7f8d6ad886348454c238ca49ef01c7fde83925372c414e9e98827ea204ae73de
K MSB: 01111111100011010110101011011000
K LSB: 00000100101011100111001111011110
r: 0x44022028cf3771072718602a8157c92b7d905c194ba38045a6177a06fd3dc362
s: 0x38a60220520b4b1d36d55070419e21c1d0b47511d96477bbea459202ad3aa2e7
z: 0xb9354ccf66a361b618f067f6c1244f1495776d7cb095be0ac1e86d0992d79cdd
Script: 473044022028cf3771072718602a8157c92b7d905c194ba38045a6177a06fd3dc362e738a602205 20b4b1d36d55070419e21c1d0b47511d96477bbea459202ad3aa2e72231e6c501210321369b6c05 4bf52f4f21091f1bebe71c8da184ef75d88b45a2f463bdf5f162af
K: 41134620020427918509232437735715264323869950887026447086088473267917728820592
K (hex): 0x5af15eafdc0f849634732c16028047bc43358f6c16207fc2bf1fac8faaf0ad70
K MSB: 01011010111100010101111010101111
K LSB: 10101010111100001010110101110000
r: 0xabe9088f1c430549d33070c4343d83b68fc6b7f798b778d3466126303eea4861
s: 0x2d23b76fe88bcfb2674feb500d56cb5603957d25b21dfadedd4d029cf9d35b8b
z: 0xb9354ccf66a361b618f067f6c1244f1495776d7cb095be0ac1e86d0992d79cdd
Script: 483045022100abe9088f1c430549d33070c4343d83b68fc6b7f798b778d3466126303eea4861022 02d23b76fe88bcfb2674feb500d56cb5603957d25b21dfadedd4d029cf9d35b8b01210321369b6c 054bf52f4f21091f1bebe71c8da184ef75d88b45a2f463bdf5f162af
K: 57812917839694142708293111517794561297960475000280608277966594035734982329126
K(hex): 0x7fd0f3b066dc682f38a391f58c560f4e3caba5f2e37d3803ca837e682dfa8326
K MSB: 01111111110100001111001110110000
K LSB: 00101101111110101000001100100110
r: 0x4402200bfde30fc1a4a05a263aefa1627eea9c4649ca5c445648a7f33de43b68
s: 0xb34e0220639938ce29ab4a32d8d518ee893c96e79c582c7fe916282868ec1783
z: 0xb9354ccf66a361b618f067f6c1244f1495776d7cb095be0ac1e86d0992d79cdd
Script: 47304402200bfde30fc1a4a05a263aefa1627eea9c4649ca5c445648a7f33de43b68afb34e02206 39938ce29ab4a32d8d518ee893c96e79c582c7fe916282868ec1783ac9afef101210321369b6c05 4bf52f4f21091f1bebe71c8da184ef75d88b45a2f463bdf5f162af
I found a duplicate Z-value Does this help with recovery I don't understand very well I used RSZK to restore the private key will become 1 Does this have anything to do with lattice attack?
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://bitcointalk.org/index.php?topic=5315607.0
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
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://bitcointalk.org/index.php?topic=5315607.0
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
r=0xd218788520228f202ee29ab37136e78c6f907e6a376acec375442623f91da9c2
s=0x1a98db00687af1171626d98be8a78f9a733e50c3b8e56640f8f284c8c19ed5cc
z=0xb7a48eb446ab5b43e5a9808efe17df065965d8b090666d6f5deb63ed1ff1cfe7
Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
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
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://bitcointalk.org/index.php?topic=5315607.0
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?
Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
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
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://bitcointalk.org/index.php?topic=5315607.0
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?
Re: I have 26 out of 24 mnemonic words. Am I able to brute force still?
So I'm solving a private puzzle and I have a list of 26 valid mnemonic words out of 24. The first 6 are in order and the rest are not. Would it be possible to bruteforce this mnemonic still? If so how can I and how long would it roughly take?
可以发出来 我试着帮你跑一下试试看
Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
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
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
Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
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
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?
Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
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
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
Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
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
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
...I was understand this using this wayBr
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
no, straid is from calculus. of r,s,z
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?
Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
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
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
...I was understand this using this wayBr
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
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.
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'
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 ...
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.
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
i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.
so my question is,
please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?
and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,
please check my code to see where i can improve. thank you.
Code:
import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141
E = EllipticCurve(GF(p), [0, 7])
G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)) # Base point
r=0x
s=0x
z=0x
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
def make_public(r,s,z):
R = E.lift_x(Integer(r))
w = int(modinv(s, n))
u1 = int((z * w) % n)
u2 = int((r * w) % n)
#R=u1*G + u2*public_key
#pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
u_n2=modinv(u2,n)%n
u_n1=- u1*modinv(u2,n)%n
pub=u_n1*G + u_n2*R
pub2=u_n1*G + u_n2*(-R)
return pub,pub2
def verify(r, s,z,public_key):
w = int(modinv(s, n))
u1 = int((z * w) % n)
u2 = int((r * w) % n)
D=u1*G + u2*public_key
x,y=D.xy()
x=int(x)
if (r % n) == (x % n):
print( "signature matches")
else:
print("invalid signature")
def calc_u(r,s,z):
mod_s= modinv(s,n)%n
u1=mod_s*z%n
u2=mod_s*r%n
print("u1==",u1,"n-u1=",n-u1)
print("u2==",u2,"n-u2=",n-u2)
return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()
# Find the real mod n for k and K nonce
for i in range(1, n):
k = (r * i + z) * modinv(s, n) % n
R = E.lift_x(Integer(r))
K = k * G
u1 = (modinv(s, n) * z) % n
u2 = (modinv(s, n) * r) % n
if K == (u1 * G + u2 * R):
print("Found real k:", k)
break
Traceback (most recent call last):
File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined
It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?
this is a SAGEMATH code, not python
and needs put r,s,z data to:
r=0x
s=0x
z=0x
G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)) # Base point
I'd like to ask if I start with this line of code, and if so, which range value does it look like?
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.
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
i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.
so my question is,
please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?
and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,
please check my code to see where i can improve. thank you.
Code:
import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141
E = EllipticCurve(GF(p), [0, 7])
G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)) # Base point
r=0x
s=0x
z=0x
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
def make_public(r,s,z):
R = E.lift_x(Integer(r))
w = int(modinv(s, n))
u1 = int((z * w) % n)
u2 = int((r * w) % n)
#R=u1*G + u2*public_key
#pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
u_n2=modinv(u2,n)%n
u_n1=- u1*modinv(u2,n)%n
pub=u_n1*G + u_n2*R
pub2=u_n1*G + u_n2*(-R)
return pub,pub2
def verify(r, s,z,public_key):
w = int(modinv(s, n))
u1 = int((z * w) % n)
u2 = int((r * w) % n)
D=u1*G + u2*public_key
x,y=D.xy()
x=int(x)
if (r % n) == (x % n):
print( "signature matches")
else:
print("invalid signature")
def calc_u(r,s,z):
mod_s= modinv(s,n)%n
u1=mod_s*z%n
u2=mod_s*r%n
print("u1==",u1,"n-u1=",n-u1)
print("u2==",u2,"n-u2=",n-u2)
return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()
# Find the real mod n for k and K nonce
for i in range(1, n):
k = (r * i + z) * modinv(s, n) % n
R = E.lift_x(Integer(r))
K = k * G
u1 = (modinv(s, n) * z) % n
u2 = (modinv(s, n) * r) % n
if K == (u1 * G + u2 * R):
print("Found real k:", k)
break
Traceback (most recent call last):
File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined
It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?
this is a SAGEMATH code, not python
and needs put r,s,z data to:
r=0x
s=0x
z=0x
Okay, thank you, how do I import it into BSGS?
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.
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
i got really lucky because i was told that 6 weeks was really fast. but.. i am hoping to go faster.
so my question is,
please take a look at my code in sagemath, and see what i might have miss out or can improve to make it much better?
and while im here, i was told the u1 value some sort of give a "hint" on the k nonce. i realise that it just really is the real mod n of k nonce only but its not k nonce itself,
please check my code to see where i can improve. thank you.
Code:
import random
p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141
E = EllipticCurve(GF(p), [0, 7])
G = E.point( (0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798,0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8)) # Base point
r=0x
s=0x
z=0x
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
def make_public(r,s,z):
R = E.lift_x(Integer(r))
w = int(modinv(s, n))
u1 = int((z * w) % n)
u2 = int((r * w) % n)
#R=u1*G + u2*public_key
#pub= R*modinv(u2,n) - u1*modinv(u2,n)%n
u_n2=modinv(u2,n)%n
u_n1=- u1*modinv(u2,n)%n
pub=u_n1*G + u_n2*R
pub2=u_n1*G + u_n2*(-R)
return pub,pub2
def verify(r, s,z,public_key):
w = int(modinv(s, n))
u1 = int((z * w) % n)
u2 = int((r * w) % n)
D=u1*G + u2*public_key
x,y=D.xy()
x=int(x)
if (r % n) == (x % n):
print( "signature matches")
else:
print("invalid signature")
def calc_u(r,s,z):
mod_s= modinv(s,n)%n
u1=mod_s*z%n
u2=mod_s*r%n
print("u1==",u1,"n-u1=",n-u1)
print("u2==",u2,"n-u2=",n-u2)
return u1,u2
u1, u2 = calc_u(r,s,z)
pub1,pub2=make_public(r,s,z)
print("public_key1",pub1)
print("pub1_x=",hex(pub1.xy()[0]))
print("public_key2",pub2)
print("pub2_x=",hex(pub2.xy()[0]))
verify(r,s,z,pub1)
verify(r,s,z,pub2)
print()
# Find the real mod n for k and K nonce
for i in range(1, n):
k = (r * i + z) * modinv(s, n) % n
R = E.lift_x(Integer(r))
K = k * G
u1 = (modinv(s, n) * z) % n
u2 = (modinv(s, n) * r) % n
if K == (u1 * G + u2 * R):
print("Found real k:", k)
break
Traceback (most recent call last):
File "/content/SageMath/crack_weak_ECDSA_nonces_with_LLL.py", line 9, in <module>
E = EllipticCurve(GF(p), [0, 7])
NameError: name 'EllipticCurve' is not defined
It's strange. Yesterday was still running fine, but today after restarting the cloud code, why did it end up like this?
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
you use kangaroo multy gpu from GL or keyhunt ?
use Google .......so I find 2 private key from his 2 rsz
1:
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1
Starting Program...
======================================================================
[Input Index #: 0]
R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9
2: puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc
Starting Program...
======================================================================
[Input Index #: 0]
R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Ok but how can I find these rsz with this script very fast?
I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.
This method for ex:
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
with this
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
i answer you in pm
Okay thank you
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
you use kangaroo multy gpu from GL or keyhunt ?
use Google .......so I find 2 private key from his 2 rsz
1:
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1
Starting Program...
======================================================================
[Input Index #: 0]
R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9
2: puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc
Starting Program...
======================================================================
[Input Index #: 0]
R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Ok but how can I find these rsz with this script very fast?
I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.
This method for ex:
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
with this
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
raceback (most recent call last):
File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 147, in <module>
R = E.lift_x(Integer(r))
NameError: name 'E' is not defined
Oh, after adding n values to my sky, it turned out like this again
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
you use kangaroo multy gpu from GL or keyhunt ?
use Google .......so I find 2 private key from his 2 rsz
1:
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1
Starting Program...
======================================================================
[Input Index #: 0]
R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9
2: puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc
Starting Program...
======================================================================
[Input Index #: 0]
R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Ok but how can I find these rsz with this script very fast?
I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.
This method for ex:
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
with this
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
Traceback (most recent call last):
File "C:\Users\Administrator\Desktop\bsgs-main\v7_gpu_trial\bsgs_GPU.py", line 144, in <module>
k = (z + i )%n # * modinv(s, n) % n #start range
NameError: name 'n' is not defined
This error will occur when I directly change the BSGS before running it again
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
you use kangaroo multy gpu from GL or keyhunt ?
use Google .......so I find 2 private key from his 2 rsz
1:
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1
Starting Program...
======================================================================
[Input Index #: 0]
R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9
2: puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc
Starting Program...
======================================================================
[Input Index #: 0]
R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Ok but how can I find these rsz with this script very fast?
I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.
This method for ex:
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
with this
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187
oh f-k, you really find privkeys?
you use kangaroo multy gpu from GL or keyhunt ?
you use kangaroo multy gpu from GL or keyhunt ?
use Google .......so I find 2 private key from his 2 rsz
1:
D:\python\bitcoin_rsz>python getz_input.py -txid a37f2f87bd371d621178605a79062010298c31fc884ed966a2041684eb8198f1
Starting Program...
======================================================================
[Input Index #: 0]
R: 57a463b8ac30f2ed36767d5ccabf04fbe29c94b054b4309996f086556428c748
S: 5a4c7e96159688e8cd2525a3230ec5184597d6cfbaf037ca5815fa01097f67cc
Z: a37f38a2db651ba57f68ef4d0ac297e732d0eb3954bb85ac069569f9b372daa0
PubKey: 02f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9
2: puzzle #65
D:\python\bitcoin_rsz>python getz_input.py -txid 65c7e5cbff719ff7fd32645b777cb20b69db513f1cd6a064dfcc95b69ad77acc
Starting Program...
======================================================================
[Input Index #: 0]
R: 4f7f2657387cf1fef8152e2bbd39f153ee235e1f46294fded0d42dacbbe7ea
S: 430773be7ebda7fba5ed2f829e9b47a7f92d526905c250780f044ed860de0786
Z: 76757e4b29801bbb747a125c0bb6752feeeabd84c58fe3dd71e94eed3839dfaa
PubKey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Ok but how can I find these rsz with this script very fast?
I know this script, but how can I find the private key from this rsz? Very fast, so 256 bits is a very long time.
This method for ex:
https://bitcointalk.org/index.php?topic=5492520.msg63946187#msg63946187