MIT Cuts Quantum Encryption-Breaking Memory to 2 Slots Using Fibonacci
Updated
Updated · Futura · Jul 18
MIT Cuts Quantum Encryption-Breaking Memory to 2 Slots Using Fibonacci
1 articles · Updated · Futura · Jul 18
Summary
MIT researchers devised a Fibonacci-based quantum method that keeps Regev’s 2023 speedup for factoring while slashing memory use to two slots, returning qubit needs to roughly Shor-era levels.
The gain comes from replacing repeated squaring—which piles up quantum memory—with simpler multiplication, and the design also tolerates hardware noise that older approaches could not.
Oded Regev said the paper solves the two biggest memory problems in his 2023 design, which had delivered the first major factoring improvement since Shor’s 1994 algorithm.
Quantum code-breaking still remains distant: experts estimate about 20 million qubits would be needed, versus just over 1,100 in today’s largest machines, and the new method helps only for numbers above current internet key sizes.
Has MIT's 'Fibonacci shortcut' made the quantum threat an immediate five-year problem for global cybersecurity, not a distant theory?
With code-breaking theory accelerating, is our security transition happening fast enough to protect today's harvested secrets?
MIT’s 2024 Quantum Factoring Algorithm Cuts Memory to Two Qubits, Raising Urgency for Post-Quantum Security
Overview
MIT researchers have made a major breakthrough in quantum computing by drastically reducing the memory needed for quantum code-breaking. Their new algorithm, developed by Seyoon Ragavan and Professor Vinod Vaikuntanathan, uses the Fibonacci sequence and reversible multiplication to cut memory requirements down to just two quantum slots. This is achieved through a clever 'Fibonacci shortcut' method that works like a ping-pong game, continuously swapping information between two registers. By overcoming a key bottleneck in quantum factoring, this innovation brings the possibility of breaking widely used cryptographic systems much closer to reality.