Quote from: satashi_nokamato on February 23, 2024, 05:26:52 PM

Quote from: mckemo on February 22, 2024, 08:30:52 PM

Thats the problem i got here.
The tool von iceland is indeed working. It reduces to a lower keyspace precisely.
But i don´t understand what exactly it is doing.
And thats the point-> I can not reverse anything what i don´t understand what has been done.
Thats what i am asking for. Can somebody help me to understand, what iceland exactly has done, and how to reverse it onto the found privkey?
Keymath won´t help here, because i don´t know, what i got to enter..
i don´t know the divisor or how to even get it..
It seems like it is subtracting with Generatorpoint G, but.. what about the privkey?!

maybe somebody can help me to change the script of iceland, so it shows the correct calculation like in albertos keysubtract.

If you don't understand what it is doing, then how do you know it reduces the range precisely? What results did you get to know it's precision?
Show us exactly what you are doing, but you can not know the private key of the public key which you are working with, provide the exact setup you are using so we can help you better.

When you input a public key into such tools, whatever results you get, they will all behave the same, to explain better, take 52 and divide by 4 to get 13, but now you need to generate at least 13 points and save them in order to compare against your results when you divide.
However if the target is 51/4= 12.75, then if you multiply by 4, you will always get the original target back and the difference is that you can't tell if you got 13 as the result or 12.75, only way to know that is to have all the points from 1 to 13. Now if you are dividing a key in 64 bit range by 2, you need to have all the points from 1 to 2**63 saved to compare with the results.

Let's say you managed to reduce a key down to 28 bits, if you are sure about it you can easily brute force it, but when we are dealing with big numbers there is no easy way to reduce the range down to 28 bits.

Why? As an example, let's try with large keys.
This is 2**130

Code:

1361129467683753853853498429727072845824

If you try dividing it by anything other than the power of 2, you would get much larger numbers as the result, now let's divide by 2**64 to get this result

Code:

73786976294838206464

Here is the tricky part, if you try to divide by 2**64+1, the result would be larger, the only way to know for sure that you are not missing a divisor is to try dividing by 2**64+1 up to 2**65 one by one just to see if you can hit this one

Code:

36893488147419103232

And that one is known, while working with unknown keys, there is no easy way other than trying all above.

float part after dividing cant be lager then divider