CrunchyF
A question for you.
If you know how to define the range in which the private key is located.
How can I find out the private key?
What is an algorithm?
P.S. I have previously asked this question on this forum people who also boasted that if you know the range you can find out the private key.
They did not provide answers. (Either they don't know how to brag or they don't want to share.)
Yes you can !
but only with this following condition:
1)the public key you have is a raw point (x,y) and not a pubkeyhash (in this case only bruteforce in the range is possible).
2) You had an "oracle" which can tell where is the range of any public key with a precision > 50%. ( 50.000000001% would be ok depending of your power of computation)
It is difficult to answer to your question about a specific algorithm because the algorithm you have to designed depend on the information you can guess on the privkey with the public key
But for example if you can tell if your point is located in the first half or in the second half of N [1,N/2] or in [N/2,N] this is a possible algorithm:
you divide your point by 2 ( pt' = pt*inv_mod(2,P)) to transfer your point in the upper or in the lower of the range of N as follow :
[1,N/2] if priv (in priv*G) is
even:
and
[N/2,N] if priv (in priv*G) if point is
odd:
you run your oracle.
with his prediction you can deducte that your initial privkey is even or odd.
If your oracle is not 100% accurate you repeat the guess with other same point (for example in our case you add 2 on your initial point (to be sure to stay in our range, and to be sure that the new point have the same parity than the initial ) and you rerun your oracle enough times needed to draw a statistical signifiant trend.
if you know that your priv is odd or even you can use the simple algorithm to decompose a number in binary representation and redo 256 times the process
and that it
Fanch