Quote from: mjojo on Today at 03:54:11 AM

Just share from noob Grin

. Ecc just processing in cyclic only from even Pvkey/Pubkey. We have two option in doubling (0) or doubling part of addition (1), if N number can derived to pubkey we can make sure which one is odd and even and continue derived bit by bit to define Pvkey..but until now this is impossible because range must be N-1 that why higher Pvkey must be substract with N, maybe waiting man with Einstain brain to manipulating curve and found the backdoor.
Thank for Albert0bsd for the ecctools

In ECC, private keys are multiplied by a generator point on the curve to produce public keys. This process is computationally "easy" (like accelerating an object). However, reversing the operation to retrieve the private key (the discrete logarithm problem) is computationally infeasible, akin to requiring infinite energy to break the speed of light. Just as there is no known physical mechanism to break the light-speed barrier without rewriting the laws of physics, there is no known mathematical "backdoor" to efficiently solve the discrete logarithm problem on elliptic curves without breaking fundamental number-theoretic assumptions. Hacking ECC private keys without using a significant amount of energy (e.g., an abnormally large number of GPUs) would require groundbreaking mathematical discoveries, such as entirely new algorithms or computational paradigms (e.g., practical quantum computing).