- 7,678
- 12,360
- TL;DR Summary
- Q-day is expected to arrive by around2035. How to deal with the potential pitfalls?
Edit:
Q-Day refers to the point in time when Quantum-based algorithms will be able to break within hours, large-enough keys used in factoring-based encryption, e.g., n=2048 for RSA 2048.
What will we do, what will be the pitfalls, when Quantum Computers are able to factor , say, large-enough keys, depending of the type of factoring-based encryption (Asymmetric)? This is the basis of most encryption models used nowadays. Some are said to be acquiring and storing large amounts of data now, aka, "Harvest now, Decrypt later"(2) , to use said data upon the availability of strong-enough Quantum Computers, which may compromise security.
Currently , alternative encryption methods exist, while others are being researched, so that this may end up being a new version of Y2K, where we will refit all our databases/data storage in time, so that it will be a non-event, albeit the situation is more uncertain in that, for one, the solutions aren't as clear as those of Y2K.
Major Quantum-based current algorithms to contend with are are Shor's , which can factor in Polynomial time, and Grover's algorithms (3)(4) . Shor's presents issues for Asymmetric encryption methods( like RSA or ECC) . Symmetric algorithms (No keys exchanged, e.g., AES 256, may be mitigated by using larger keys ))Major Any opinions?
Edit: I tried to change the "Downfall" for "Pitfalls", but the option to edit the TL; DR seems to be disabled.
1) Time estimates for onset of Q-day : https://www.secureworks.com/blog/predicting-q-day-and-impact-of-breaking-rsa2048
2) Harvest now, decrypt later:
https://www.appviewx.com/blogs/what-you-need-to-know-about-harvest-now-decrypt-later-attacks/
3)https://en.wikipedia.org/wiki/Grover's_algorithm
4)https://en.wikipedia.org/wiki/Shor's_algorithm
3) https://en.wikipedia.org/wiki/Grover's_algorithm
4)https://en.wikipedia.org/wiki/Shor's_algorithm
Q-Day refers to the point in time when Quantum-based algorithms will be able to break within hours, large-enough keys used in factoring-based encryption, e.g., n=2048 for RSA 2048.
What will we do, what will be the pitfalls, when Quantum Computers are able to factor , say, large-enough keys, depending of the type of factoring-based encryption (Asymmetric)? This is the basis of most encryption models used nowadays. Some are said to be acquiring and storing large amounts of data now, aka, "Harvest now, Decrypt later"(2) , to use said data upon the availability of strong-enough Quantum Computers, which may compromise security.
Currently , alternative encryption methods exist, while others are being researched, so that this may end up being a new version of Y2K, where we will refit all our databases/data storage in time, so that it will be a non-event, albeit the situation is more uncertain in that, for one, the solutions aren't as clear as those of Y2K.
Major Quantum-based current algorithms to contend with are are Shor's , which can factor in Polynomial time, and Grover's algorithms (3)(4) . Shor's presents issues for Asymmetric encryption methods( like RSA or ECC) . Symmetric algorithms (No keys exchanged, e.g., AES 256, may be mitigated by using larger keys ))Major Any opinions?
Edit: I tried to change the "Downfall" for "Pitfalls", but the option to edit the TL; DR seems to be disabled.
1) Time estimates for onset of Q-day : https://www.secureworks.com/blog/predicting-q-day-and-impact-of-breaking-rsa2048
2) Harvest now, decrypt later:
https://www.appviewx.com/blogs/what-you-need-to-know-about-harvest-now-decrypt-later-attacks/
3)https://en.wikipedia.org/wiki/Grover's_algorithm
4)https://en.wikipedia.org/wiki/Shor's_algorithm
3) https://en.wikipedia.org/wiki/Grover's_algorithm
4)https://en.wikipedia.org/wiki/Shor's_algorithm
Last edited: