|
How to go about generating keys from specific ranges?
|
|
|
|
|
Well it was already said that Pollard's Kangaroo the best script at this point can search for private keys with the public key but still can take a long time with that especially with bigger keys or bigger search range. Unless someone knows another approach to shorten the search range.
|
|
|
|
Yes but if the first G is randomly chosen and the coordinates of public key are given to someone he can't prove he owns the public key, even if he has the private key. The G is something unknown, meaning that he can't start our `painting` if he only has the number we multiply G. This is what I don't get...
So G is the secret then, that you are trying to look for? |
|
|
|
Is there a code or script to do the math?
It's easier than you might think. In fact, you can use any library that allows you to calculate the public key from a private key and replace the parameters: # Elliptic curve parameters (secp256k1) P = 2**256 - 2**32 - 977 N = 115792089237316195423570985008687907852837564279074904382605163141518161494337 --> original parameter #N = 57896044618658097711785492504343953926418782139537452191302581570759080747169 --> here to divide by 2 for example A = 0 B = 7 Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240 --> here put the key you want to divide Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424 --> same for y coordinate G = (Gx, Gy) So sorta like this: _p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2FL _r = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141L _b = 0x0000000000000000000000000000000000000000000000000000000000000007L _a = 0x0000000000000000000000000000000000000000000000000000000000000000L _Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798L _Gy = 0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8L But you do have to have the private key though? |
|
|
|
|
Is there a code or script to do the math?
|
|
|
|
So from further reading, it doesn't look like I need to change the distances, as they will be in the same range with same jumps. I would just need to redo the private keys (right side) to equal new pub being searched for. How to do? After more reading and researching and taking samples from Etar's reconstructor, apparently all I have to do, to tame wilds, is to subtract range from wild's priv/xpub coord. Leave distances alone, subtract range (which is odd because it will all be same range) and bam, new tamed wilds. Edit: actually offset previous private key - start range. Example: if previous search was for 8F400000000 and you want to tame the wilds for that search and search for a new pubkey in same range; take 8F400000000 - start range of 80000000000 = F400000000 ; now add that to previous wilds priv/pub xcoord So are you trying to merge different ranges to the same public key? If yes did it work? |
|
|
|
Anyone besides me still chasing #120? I do have a question for the community...I've been using Etar's dp reconstructor (already compiled, can't view source code) and it works great for taming wild kangaroos. However, is it necessary to have to know the private key (that you were searching for) in the work file or do you only need to know the pub key? Also, does anyone know how to go about taming the wilds via a python script? Example: here is a line from one of my wild workfile: 26820E1D54B30FE9F13F7B99BE9CD19F4E47AAD61FD6D1F3C59874C500000000 0000000000000000000000000000000000E7DCAB65369C5F7CC15D08EEE48C67 so let's say it was for some pubkey 03......at the 120 bit range. How would I tame the wilds to say some pubkey 02.... in the same 120 bit range? All new pubkeys that I search for will be in the same range, so just need to reconstruct the wild kangaroos to the new pubkey. But would be ok if code can reconstruct in different range too. So from further reading, it doesn't look like I need to change the distances, as they will be in the same range with same jumps. I would just need to redo the private keys (right side) to equal new pub being searched for. How to do? What's the link to that script you're using? |
|
|
|
|
Does anyone know the correct math and is there a script to do the math for you or do you have to do the math manually?
|
|
|
|
In fact a parallel kangaroo program that look for a single key creates several pubkeys from this key (by simply translating it). So this is a multi key search but this does not decrease the probability to solve this single key. It just allows a simple parallelization.
Usually, for a multi target attack, the first key has no benefit but the following keys can gain from the previous calculation.
If you want to search a pubkey with a x starting with 32 leading F (between n and p), you will have to perform ~2^128 group operations.
@Jean_Luc What exactly is the base key and why we can't manually change it? |
|
|
|
can you please share a python program to find private key from public key using baby giant step method
https[Suspicious link removed] Thanks Bigvito. Its helpful. Can you please share the same program in python Oh I forgot about this one is in python, this was last updated last year. https://github.com/Telariust/pollard-kangaroo |
|
|
|
I know a method how to find a private key for any publick key, but with modified base point(false BP). If someone making a code for calculating a private key for real base point, I will share code for find a private key for false base point and REAL publick key. This is a examles: Real BTC Basepoint (55066263022277343669578718895168534326250603453777594175500187360389116729240 : 32670510020758816978083085130507043184471273380659243275938904335757337482424 : 1)
False BTC Base Point [u](52426333756564302526085053269432084545410002202648992412042160756077650870390 : 79709923240617764371931483354308897031409999608033097982950682278401348639896 : 1)[/u]
[b]REAL Public key[/b] Q(41092972045662183626692698115026263699106807529773860274318687111639116151521, 25612602434799576731996141476317124058234433726241370033130536741579356668244)
[b]Public key generated[/b] Q1 (41092972045662183626692698115026263699106807529773860274318687111639116151521, 25612602434799576731996141476317124058234433726241370033130536741579356668244)
[b]Q1==Q True[/b]
[b]Private key [/b]87954421572711191797409873682088439575132560617980964771068188888320747613432 !!!
Any help are welcome !!!  Well, why dont you use Pollard on any public key exposed before 2015 with a balance. Much easier than what you are trying to do. Or even throw ina few custom spartan 6 to spin off that private key recovery. What's special about public keys exposed before 2015? |
|
|
|
|
How do I turn this 5KRFMvDqVFALC3t2qiRuctoxGLoTqRuLdoqqpdqustqv into hex if it has missing letters?
|
|
|
|
|
I didn't even know about this puzzle, I see people complaining how difficult it is.
|
|
|
|
Rather than searching for addresses you should search for pubkey with funds (there are a lot) with a kangaroo or rho program. It will be much faster, ~2.4e19 years with rho or kangaroo against ~9e28 years with address finder (on 256xTelsa V100)  Do not use my kangaroo program which is limited to 125 bit range key search ! Edit: For instance this pubkey: 02545d2c25b98ec8827f2d9bee22b7a9fb98091b2008bc45b3b806d44624dc038c (1HQ3Go3ggs8pFnXuHVHRytPCq5fGG8Hbhx) hold 69370BTC how did you know its pubkey? It has a sent transaction when there is a sent transaction you can see the pubkey. |
|
|
|
I guess he is trying to say get a privkey from the public. These are 2 ways but they both can take some time to find the privkey. Kangaroo and RHO |
|
|
|
So this is what you all really wanted to use Kangaroo vs RHO |
|
|
|
Hi all,
So no one knows a pubkey to 64?
If pubkey to 64 was exposed it would have been solved already. |
|
|
|
Everyone knows that bitcrack only goes by consecutive keys.
Not really. You may specify your own 'distance' between key. For example: will do 1000000 keys long 'jump' between tries. That's still consecutive not random |
|
|
|
|
Show Posts
