Quantum computing threats to cryptography in Cybersecurity - Mini Project: Build & Apply

Quantum Computing Threats to Cryptography

📖 Scenario: You work in a cybersecurity team that needs to understand how quantum computing could affect current encryption methods used to protect sensitive data.

🎯 Goal: Build a simple knowledge summary that lists common cryptographic algorithms, identifies which are vulnerable to quantum attacks, and highlights quantum-resistant alternatives.

📋 What You'll Learn

Create a dictionary called algorithms with exact cryptographic algorithms as keys and their type as values

Create a list called vulnerable_algorithms containing the names of algorithms vulnerable to quantum attacks

Use a dictionary comprehension to create a new dictionary called quantum_threats that maps vulnerable algorithms to their vulnerability status

Add a final list called quantum_resistant with exact names of quantum-resistant algorithms

💡 Why This Matters

🌍 Real World

Understanding quantum threats helps cybersecurity teams prepare for future attacks that could break current encryption.

💼 Career

Cybersecurity professionals must know which cryptographic methods are safe and which need replacement as quantum computing advances.

1

DATA SETUP: Define cryptographic algorithms

Create a dictionary called algorithms with these exact entries: 'RSA': 'asymmetric', 'AES': 'symmetric', 'ECC': 'asymmetric', 'SHA-256': 'hash', 'Blowfish': 'symmetric'

Cybersecurity

# Create the dictionary algorithms with exact entries
# Your code here

Hint

Use curly braces to create a dictionary with the exact keys and values.

2

CONFIGURATION: List vulnerable algorithms

Create a list called vulnerable_algorithms containing these exact strings: 'RSA', 'ECC'

Cybersecurity

algorithms = {
    'RSA': 'asymmetric',
    'AES': 'symmetric',
    'ECC': 'asymmetric',
    'SHA-256': 'hash',
    'Blowfish': 'symmetric'
}
# Create the list vulnerable_algorithms with 'RSA' and 'ECC'
# Your code here

Hint

Use square brackets to create a list with the exact algorithm names.

3

CORE LOGIC: Map vulnerable algorithms to threat status

Use a dictionary comprehension to create a dictionary called quantum_threats that includes only algorithms from vulnerable_algorithms as keys and the string 'vulnerable' as their value

Cybersecurity

algorithms = {
    'RSA': 'asymmetric',
    'AES': 'symmetric',
    'ECC': 'asymmetric',
    'SHA-256': 'hash',
    'Blowfish': 'symmetric'
}
vulnerable_algorithms = ['RSA', 'ECC']
# Create quantum_threats dictionary using comprehension
# Your code here

Hint

Use a dictionary comprehension with for alg in vulnerable_algorithms and set each value to 'vulnerable'.

4

COMPLETION: Add quantum-resistant algorithms list

Create a list called quantum_resistant with these exact strings: 'Lattice-based', 'Hash-based', 'Multivariate'

Cybersecurity

algorithms = {
    'RSA': 'asymmetric',
    'AES': 'symmetric',
    'ECC': 'asymmetric',
    'SHA-256': 'hash',
    'Blowfish': 'symmetric'
}
vulnerable_algorithms = ['RSA', 'ECC']
quantum_threats = {alg: 'vulnerable' for alg in vulnerable_algorithms}
# Create quantum_resistant list with exact algorithm names
# Your code here

Hint

Use square brackets to create a list with the exact quantum-resistant algorithm names.

Practice

1. Which cryptographic methods are most threatened by quantum computers?

easy

A. RSA and ECC

B. AES with 256-bit keys

C. SHA-256 hashing

D. Symmetric key algorithms in general

Solution

1. Step 1: Understand quantum impact on cryptography

   Quantum computers can solve certain math problems, like factoring large numbers, much faster than classical computers.

2. Step 2: Identify vulnerable cryptographic methods

   RSA and ECC rely on hard math problems (factoring and discrete logs) that quantum computers can solve efficiently, making them vulnerable.

3. Final Answer:

   RSA and ECC -> Option A

4. Quick Check:

   Quantum computers threaten RSA and ECC [OK]

Hint: Remember: RSA and ECC use math quantum can break fast [OK]

Common Mistakes:

• Thinking AES is equally vulnerable as RSA
• Confusing hashing algorithms with encryption
• Assuming all symmetric algorithms are unsafe

2. Which of the following correctly describes a quantum-safe encryption approach?

easy

A. Using classical hashing algorithms only

B. Using longer RSA keys to resist quantum attacks

C. Relying on ECC with smaller key sizes

D. Switching to symmetric encryption with stronger keys

Solution

1. Step 1: Review quantum-safe encryption basics

   Quantum-safe encryption often involves symmetric algorithms with longer keys because they are less affected by quantum attacks.

2. Step 2: Evaluate options for quantum safety

   Using stronger symmetric keys (like AES-256) is currently safer than relying on longer RSA or ECC keys, which quantum computers can break.

3. Final Answer:

   Switching to symmetric encryption with stronger keys -> Option D

4. Quick Check:

   Stronger symmetric keys resist quantum better [OK]

Hint: Quantum-safe means stronger symmetric keys, not longer RSA [OK]

Common Mistakes:

• Believing longer RSA keys are quantum-safe
• Thinking ECC with smaller keys is safer
• Ignoring the role of symmetric key length

3. Consider this statement: "Quantum computers can break RSA encryption by efficiently factoring large numbers." What is the main reason this is true?

medium

A. Quantum computers use Grover's algorithm to factor numbers

B. Quantum computers use Shor's algorithm which factors numbers quickly

C. Quantum computers guess keys randomly faster than classical computers

D. Quantum computers rely on brute force attacks only

Solution

1. Step 1: Identify quantum algorithms relevant to factoring

   Shor's algorithm is a quantum algorithm designed to factor large numbers efficiently, which classical computers cannot do quickly.

2. Step 2: Match algorithm to RSA vulnerability

   RSA security depends on factoring large numbers being hard; Shor's algorithm breaks this assumption, making RSA vulnerable.

3. Final Answer:

   Quantum computers use Shor's algorithm which factors numbers quickly -> Option B

4. Quick Check:

   Shor's algorithm breaks RSA factoring [OK]

Hint: Shor's algorithm = fast factoring, breaks RSA [OK]

Common Mistakes:

• Confusing Grover's algorithm with factoring
• Thinking quantum computers guess keys randomly
• Assuming brute force is the main quantum method

4. A developer tries to protect data by doubling the RSA key size from 2048 to 4096 bits, expecting it to be quantum-safe. What is the main problem with this approach?

medium

A. Doubling key size makes RSA vulnerable to classical attacks

B. 4096-bit keys are too short for classical security

C. Quantum computers can still break RSA efficiently regardless of key size

D. RSA keys cannot be doubled in size

Solution

1. Step 1: Understand quantum impact on RSA key size

   Quantum computers running Shor's algorithm can factor large numbers efficiently, so increasing key size does not stop quantum attacks.

2. Step 2: Analyze why doubling key size is ineffective

   Doubling RSA key size only increases classical security but does not prevent quantum algorithms from breaking it efficiently.

3. Final Answer:

   Quantum computers can still break RSA efficiently regardless of key size -> Option C

4. Quick Check:

   Quantum attacks bypass key size increase [OK]

Hint: Quantum breaks RSA no matter key size [OK]

Common Mistakes:

• Thinking bigger keys stop quantum attacks
• Believing 4096-bit keys are insecure classically
• Assuming RSA keys cannot be changed

5. An organization wants to prepare for future quantum threats. Which combined strategy best protects their data?

hard

A. Replace all RSA and ECC with quantum-safe algorithms and use AES-256 for symmetric encryption

B. Keep RSA and ECC but increase key sizes and use SHA-1 for hashing

C. Use only classical symmetric encryption with 128-bit keys and no changes to asymmetric keys

D. Switch to ECC with smaller keys and rely on classical hashing

Solution

1. Step 1: Identify quantum-safe asymmetric algorithms

   Quantum-safe algorithms are new cryptographic methods designed to resist quantum attacks, replacing vulnerable RSA and ECC.

2. Step 2: Combine with strong symmetric encryption

   Using AES-256 provides strong symmetric encryption that is currently resistant to quantum attacks when keys are sufficiently long.

3. Step 3: Evaluate other options for weaknesses

   Increasing RSA/ECC keys or using outdated hashes like SHA-1 does not protect against quantum threats; smaller keys weaken security.

4. Final Answer:

   Replace all RSA and ECC with quantum-safe algorithms and use AES-256 for symmetric encryption -> Option A

5. Quick Check:

   Quantum-safe asymmetric + strong symmetric = best protection [OK]

Hint: Use quantum-safe algorithms plus AES-256 for best defense [OK]

Common Mistakes:

• Relying on bigger RSA/ECC keys alone
• Using weak hashes like SHA-1
• Ignoring quantum-safe asymmetric replacements