[hackcasual]

Bitcoin signatures rely on the difficulty of elliptic logarithms, not factoring, and only publish hashes of the public keys until they spend an address, meaning the vulnerable window is quite short as long as they never reuse private keys.

The papers claim, that np but very likely not np-hard problems are likely to be in p is applicable though to breaking ECC