Security in Quantum Computing Quiz

Study Notes

Cryptography ensures privacy and security of online communications and transactions.
Quantum computing is the next generation of computing, using subatomic particles to solve complex mathematical problems quickly.

Classical computing uses bits that can only represent 0 or 1.
Quantum computing uses qubits that can represent both 0 and 1 simultaneously due to superposition.
Quantum computers can sift through huge numbers of possibilities and extract potential solutions to complex problems.

Brute-force attacks can break classical cryptographic algorithms quickly.
A 4-qubit quantum computer can simultaneously represent all 16 possible combinations of a 4-bit password due to superposition.

Data Encryption Standard (DES): 56-bit key length, broken in 1999.
Triple DES (3DES): encrypts, decrypts, and re-encrypts data.
Rivest Shamir Adleman (RSA): based on mathematical challenges, key size between 2048 and 4096 bits, already broken in 2010.
Advanced Encryption Standard (AES): depends on integer factorization and discrete logarithms challenges.

Quantum computers pose a threat to current cryptographic systems.
Quantum-resistant cryptographic algorithms and protocols are needed, such as Post-quantum Cryptography (PQC).
PQC is a cryptographic system that resists quantum attacks.

PQC algorithms include Rainbow, McEliece, and others.
Rainbow: a multivariate PQC algorithm proposed in 2005, with 207 classical bits and 169 qubits.
McEliece: a code-based cryptosystem with fast decryption and encryption, but heavy key length.

Quantum key distribution (QKD) is a secure communication method that uses quantum mechanics principles.
QKD provides provably unbreakable security guarantees, even in the presence of an eavesdropper.

Quantum supremacy is the experimental demonstration of a quantum computer's dominance over classical computers.
Quantum computers can perform calculations previously impossible at unmatched speeds.

Classical encryption algorithms are vulnerable to attacks from quantum computers, hence the need to replace them with Post-Quantum Cryptography (PQC) algorithms.

PQC is classified into four cryptosystems: Rainbow, McEliece, and others.
Rainbow is a multivariate PQC algorithm proposed by D.Schmidt and J.Ding in 2005, with 207 classical bits and 169 qubits.
McEliece is a code-based cryptosystem developed by Robert McEliece, having an issue of heavy key length, but with fast decryption and encryption processes compared to RSA algorithms.

Quantum security is based on the use of Quantum Key Distribution (QKD), which enables two parties to produce a shared random secret key.
QKD relies on quantum mechanics principles to provide provably unbreakable security guarantees, even in the presence of an eavesdropper.

Quantum supremacy is the experimental demonstration of a quantum computer's dominance and advantage over classical computers by performing calculations previously impossible at unmatched speeds.

Quantum computers can break classical encryption algorithms due to their ability to perform calculations at unmatched speeds.
A 4-bit password can be broken by a quantum computer in a single step due to superposition.

Data Encryption Standard (DES) has a key length of 56 bits, which was broken in 1999 in 22 hours, and now in just 6 minutes.
Triple DES (3DES) encrypts, decrypts, and re-encrypts data, but has a heavy key length.
Rivest Shamir Adleman (RSA) is based on mathematical challenges, with a key size between 2048 and 4096 bits, but was already broken in 2010.
Advanced Encryption Standard (AES) depends on the challenges of integer factorization and discrete logarithms.

Quantum computing is the next generation of computing, based on quantum physics, using subatomic particles such as electrons or photons.
Quantum computing has the capability to sift through huge numbers of possibilities and extract potential solutions to complex problems and challenges.
Quantum computing vs. classical computing: Quantum computing uses quantum bits or qubits that can represent both 0 and 1, while classical computing uses bits that can only represent either 0 or 1.