What Is the Risk of an Attacker Finding the Private Key Once the Public Key Is Known?

While knowing the public key makes the private key a target, finding the private key from the public key is still computationally infeasible due to the nature of the Elliptic Curve Digital Signature Algorithm (ECDSA). This is known as the Discrete Logarithm Problem.

However, if the public key is exposed before the first transaction, an attacker has more time to attempt to crack the private key, potentially through future advances in computing power like quantum computers.