|
2020-09-28: Solving Quantum Cryptography
- 01:33: ... system exponentially faster than would have been possible with a pure classical computer. ...
- 04:40: ... you try prime factorization using a classical computer you’re stuck using an algorithm similar to one that was developed over ...
- 07:23: ... guesses but it’s no more likely to be the correct one than if you used a classical computer. ...
- 13:44: In fact, there’s no guarantee a classical computer won’t come up with a fast algorithm to solve them.
- 00:58: ... secrets are safe-ish for now because the most powerful classical computers will take thousands to billions of years to find those factors, ...
- 01:23: ... just last year, Google’s quantum computer, Sycamore, outsped the best classical computers for a very specific ...
- 06:21: It would take at least as long, or require at least as many parallel classical computers.
- 06:30: Classical computers store information in bits that are either 0 or 1.
|
