This is realy woked ? for ex, If I substract 128 pubkey from 255 pubkey, I will get 128 pubkey ?
No magic Cobras, just math on the curve. Come on man.
If someone will generate a random private key in the range of (let's keep it small to show it works and can be checked quickly):
WanderingPhilospher, can you show on this yor example:
2^255 3E2E2AE352CF04AA1BD62491AF51349B559F52CDBD2140A7A8C072A1FAE6FFD5
shift to 2^100
this is a public keys of 3E2E2AE352CF04AA1BD62491AF51349B559F52CDBD2140A7A8C072A1FAE6FFD5 :
0419f1854552de8509c438288726e45f049b1ebc2a7b573630437af7c443b2729070528c6d01b16
114e3a9ab033405ff2799fdb61473755073f7ca689b2ae2ef44 - 13zwUCryqSn7LPdWCKArj4UCRExpg7UYJz
0219F1854552DE8509C438288726E45F049B1EBC2A7B573630437AF7C443B27290 - 1A692apD3nn1NqNZSWCd1oyfEhxM7J7F1Q
?
I now not really understand and trust this method(dividing of pubkey what can be worked...) and I hope you can help understand me more
Thank you
Regard
The only way to get a key down from 2^255 to 2^100 is to divide by 2^155. Meaning you would take that pubkey and divide it by 0, 1, 2, 3, 4, 5, ... all the way to 2^155 (which is a HUGE number) even if your computer could divide and write to file a trillion pubkeys a second, and start a new file once the current file got up to say 1 GB, there is still no way to capture from 0 to 2^155 pubkeys. It would take an eternity. But let us say you did manage to capture those 2^155 pubkeys...now you would have to search each and every pubkey in the 2^100 range to find the one that will give you the private key of the original 2^255 pubkey that you were searching for.
If you would have done like I asked and gave me a random pub key in a smaller range, like 2^40 range, I could show you with examples. 2^255 is to big man, for explanation purposes.