Shor’s algorithm
Shor’s algorithm can attack Bitcoin’s elliptic‑curve signatures Shor’s algorithm breaks Elliptic‑curve cryptography Yuvi Lightman announced that the memory‑efficient version of Shor’s algorithm now requires 660 qubits and 490m T gates, a 2% reduction from previous 672 qubits and 823m T gates· Entity summary generated by Graphiti
Relation timeline
BY VALID-FROM DATE- Shor’s algorithmBREAKSElliptic‑curve cryptography
Shor’s algorithm breaks Elliptic‑curve cryptography
- Yuvi LightmanANNOUNCED DECREASE IN MEMORY REQUIREMENT FORShor’s algorithm
Yuvi Lightman announced that the memory‑efficient version of Shor’s algorithm now requires 660 qubits and 490m T gates, a 2% reduction from previous 672 qubits and 823m T gates
- Shor’s algorithmCAN ATTACKBitcoin
Shor’s algorithm can attack Bitcoin’s elliptic‑curve signatures
Relations are facts Graphiti extracted from reports, not verbatim quotes. An end date means later reporting showed the relation no longer holds.