Georgia Tech paper cuts quantum attack cost on elliptic curve encryption

Georgia Tech researchers published an algorithm that simultaneously reduces qubit count and circuit complexity for attacking P-256 and secp256k1. It is the first result compressing both hardware parameters at once, changing timelines for post-quantum migration.

• Algorithm lowers both qubit count and circuit complexity for the attack
• Targets are the P-256 and secp256k1 curves
• Resource estimates for post-quantum cryptography migration updated