>Fortunately, we donʼt have an algorithm that can factor such large numbers in reasonable time. Unfortunately, we also havenʼt proven it doesnʼt exist. Even more unfortunate is that there is a theoretical algorithm, called Shorʼs algorithm, that would be able to factor such a number in reasonable time on a quantum computer. Right now, quantum computers are far from practical, but it does appear that if someone in the future manages to build one thatʼs sufficiently large, RSA becomes ineffective.
Can anyone comment on how close we are to having Shor's algorithm on a quantum computer? Is feasible like the moon landing was in 1962 when Kennedy announced that "We choose to go to the Moon" (hard, but possible with a lot of money).
Or is it still something that we have no clue how to get to?
Can anyone comment on how close we are to having Shor's algorithm on a quantum computer? Is feasible like the moon landing was in 1962 when Kennedy announced that "We choose to go to the Moon" (hard, but possible with a lot of money).
Or is it still something that we have no clue how to get to?