Please enable JavaScript.
Coggle requires JavaScript to display documents.
:star:Quantum Computing :star: (Security risks (Shor's factoring…
:star:Quantum Computing :star:
Security risks
Shor's factoring algorithm
Factors the product of P and Q where P and Q are large prime numbers
Can break RSA encryption and other prime number cryptographic systems
O((log n)^2(log log n)) Complexity + O(log n) complexity on classical computer. Gives P output to a NP problem
Links
MIT on Shor's Algorithm
Shor's algorithm risk on cryptography
Cryptography strength versus quantum
Government risk
General free flow
Effects of quantum computers on modern systems
General benefits
Ability to take advantage of QP(Quantum Polynomial) time which at best can run exponentially on a classical computation system
Superposition allows for multiple eigenstates at the same time allowing the system to essentially predict the state of an output before the function is known
Deutsche's Algorithm
Deutsh-Jozsa Algorithm
:star:Quantum Parallelism
General disadvantages