Generalized Uncertainty Principles for Quantum Cryptography. (arXiv:2302.01026v1 [cs.CR])

We know the classical public cryptographic algorithms are based on certain
NP-hard problems such as the integer factoring in RSA and the discrete
logarithm in Diffie-Hellman. They are going to be vulnerable with
fault-tolerant quantum computers. We also know that the uncertainty principle
for quantum bits or qubits such as quantum key distribution or QKD based on the
quantum uncertainty principle offers the information theoretical security. The
interesting implication with the paradigm shifts from classical computing to
quantum computing is …

algorithms bits computers cryptography diffie distribution factoring hard hellman information integer key paradigm principles problems public qkd quantum quantum computers quantum cryptography quantum key distribution qubits rsa security uncertainty vulnerable