Quantum computing bombshells that are not April Fools
5 hours ago
- #cryptography
- #bitcoin-security
- #quantum-computing
- Two key quantum computing announcements were made: one from Caltech on fault-tolerance with lower overhead using high-rate codes for architectures like neutral atoms, and another from Google on a lower-overhead implementation of Shor's algorithm to break 256-bit elliptic curve cryptography.
- Google published their result via a zero-knowledge proof without revealing circuit details, a novel approach with historical parallels, though it may only delay others from finding the circuit.
- Combining these advances suggests Bitcoin signatures could be vulnerable earlier than thought, with an estimated need for only 25,000 physical qubits, down from millions a year ago, though the exact time saved is unclear.
- The news underscores the urgent need to upgrade to quantum-resistant cryptography, with experts advocating for publication to raise awareness and prompt action.
- The author compares Google's approach to historical secrecy in nuclear fission but notes that respected cybersecurity experts advocate for full publication to drive security improvements.
- Journalist inquiries were handled during a busy week, and the post invites discussion while noting personal time constraints for holidays like Passover.