Why using N if range of privkey is anoth ?
Why using whatever continuous range of size 2N if you can shift the public key into a self-symmetric interval and solve that instead?Sorry, I dont know what are you talk about.I seen what you use N in your calcs. Then I take experiments with pinkey 60 bits ex, not need fool N , enoth 60 bit for find 60 bit. If soft use big N so make N operations, smaler N maybe get less operations, but privkey not changes Ofcause then change only N....
Why using N if range of privkey is anoth ?
Why using whatever continuous range of size 2N if you can shift the public key into a self-symmetric interval and solve that instead?What shift you mean ? Divide shift to right, multylpy to left, shift ","
... you talk about this shift ?
shift
:
10 / 5 = 2,0
10/50 = 0,20
10/500 = 0,020
....
no profit
Little offtop, but
x = 9901 +100 -1
d = 0
i = 1
while x >= - 9901:
d = x - 1000
x = d
print(x,i)
i = i +1
output:
9000 1
8000 2
7000 3
6000 4
5000 5
4000 6
3000 7
2000 8
1000 9
0 10
-1000 11
-2000 12
-3000 13
-4000 14
-5000 15
-6000 16
-7000 17
-8000 18
-9000 19
-10000 20
[Program finished]
if you run scrypt result will be 0, this can be pubkey of privkey 0 if replase nuber x to pubkey
also in ooint 0, will be known what lubkey is divideble to 10 without flost part.
Needs a 2**65 substraction for find pubkey divisible to 2**65. Identify what pub 130 dividebla to 2**65 will be pubkey = 0.
so, again too many operations : 2**65 substraction and 2**65 searches 0 pubkey....
enother ex:
x = 9901
d = 0
i = 1
while x >= - 9901:
d = x - 1000
x = d
print(x,i)
i = i +1
output:
8901 1
7901 2
6901 3
5901 4
4901 5
3901 6
2901 7
1901 8
901 9
-99 10
-1099 11
-2099 12
-3099 13
-4099 14
-5099 15
-6099 16
-7099 17
-8099 18
-9099 19
-10099 20
[Program finished]
lets sub any result from x:
sub - -5099:
x = 9901 - -5099
d = 0
i = 1
while x >= - 9901:
d = x - 1000
x = d
print(x,i)
i = i +1
result,:
14000 1
13000 2
12000 3
11000 4
10000 5
9000 6
8000 7
7000 8
6000 9
5000 10
4000 11
3000 12
2000 13
1000 14
0 15
-1000 16
-2000 17
-3000 18
-4000 19
-5000 20
-6000 21
-7000 22
-8000 23
-9000 24
-10000 25
[Program finished]
we had now point 0, and x is divisable to 15.
Can someone help and provide how to find clean x "going this way" ?
