Question 179 of 504
CryptographyeasyMultiple SelectObjective-mapped

Quick Answer

The answer is improper key storage and weak random number generation. Improper key storage is a common weakness because if cryptographic keys are stored in plaintext, in world-readable files, or transmitted without encryption, an attacker can easily exfiltrate them and decrypt all protected data, rendering the strongest algorithm useless. Weak random number generation is equally critical, as cryptographic operations rely on unpredictability for keys, nonces, and initialization vectors; a flawed PRNG, such as a linear congruential generator, allows an attacker to predict or reproduce these values and break session security. On the SSCP exam, this question tests your understanding that cryptography fails not from broken algorithms but from poor implementation hygiene, often appearing in scenario-based items where a developer hardcodes a key or uses `Math.random()` for crypto. A common trap is assuming only algorithm strength matters, but the exam emphasizes that entropy and key management are foundational. Remember the mnemonic: “Keys and Randomness—if either is weak, the whole system leaks.”

SSCP Cryptography Practice Question

This SSCP practice question tests your understanding of cryptography. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.

Which TWO of the following are common weaknesses in cryptographic implementations that an SSCP should be aware of? (Select exactly 2.)

Question 1easymulti select
Full question →

Answer choices

Why each option matters

Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.

Correct answer & explanation

Weak random number generation

Weak random number generation is a critical flaw because cryptographic keys, nonces, and initialization vectors rely on unpredictability. If an attacker can predict or reproduce the random values (e.g., due to a low-entropy source or a flawed PRNG like a linear congruential generator), they can derive secret keys or break session security. This undermines the entire cryptographic system regardless of the algorithm strength.

Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.

Answer analysis

Option-by-option breakdown

For each option: why learners choose it and why it is or isn't the right answer here.

  • Weak random number generation

    Why this is correct

    Predictable random numbers can lead to key compromise.

    Related concept

    Read the scenario before looking for a memorised answer.

  • Improper key storage

    Why this is correct

    Keys stored insecurely can be stolen.

    Related concept

    Read the scenario before looking for a memorised answer.

  • Frequent rekeying

    Why it's wrong here

    Rekeying is a good practice.

  • Using proven encryption algorithms like AES

    Why it's wrong here

    Using proven algorithms is a strength, not weakness.

  • Following NIST guidelines

    Why it's wrong here

    Following guidelines is a strength.

Common exam traps

Common exam trap: answer the scenario, not the keyword

ISC2 often tests the misconception that 'using strong algorithms' or 'following standards' automatically guarantees security, when in fact implementation flaws like weak randomness or poor key management are the real vulnerabilities.

Detailed technical explanation

How to think about this question

Cryptographic randomness often relies on hardware entropy sources (e.g., CPU RDRAND) or OS-provided CSPRNGs (e.g., /dev/urandom on Linux). A real-world example is the Debian OpenSSL vulnerability (CVE-2008-0166) where a flawed random number generator produced only 32,767 possible keys, making SSH and TLS keys trivially brute-forceable. This highlights that even strong algorithms like RSA or AES are useless if the key generation is predictable.

KKey Concepts to Remember

  • Read the scenario before looking for a memorised answer.
  • Find the constraint that changes the correct option.
  • Eliminate answers that are true in general but not in this case.

TExam Day Tips

  • Watch for words such as best, first, most likely and least administrative effort.
  • Review why wrong options are wrong, not only why the correct option is correct.

Key takeaway

Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.

Real-world example

How this comes up in practice

A developer is choosing between AES-256 (symmetric) and RSA-2048 (asymmetric) for encrypting a large file that will be sent to a partner. Symmetric encryption is fast but requires key exchange; asymmetric is slower but solves the key distribution problem. A hybrid approach — encrypt the file with AES, encrypt the AES key with RSA — is standard. Questions like this test whether you understand when each approach applies.

What to study next

Got this wrong? Here's your next step.

Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.

Related practice questions

Related SSCP practice-question pages

Use these pages to review the topic behind this question. This is how one missed question becomes focused revision.

Practice this exam

Start a free SSCP practice session

Short sessions build daily habit. Longer sessions build exam-day stamina. Try a timed session to simulate real conditions.

FAQ

Questions learners often ask

What does this SSCP question test?

Cryptography — This question tests Cryptography — Read the scenario before looking for a memorised answer..

What is the correct answer to this question?

The correct answer is: Weak random number generation — Weak random number generation is a critical flaw because cryptographic keys, nonces, and initialization vectors rely on unpredictability. If an attacker can predict or reproduce the random values (e.g., due to a low-entropy source or a flawed PRNG like a linear congruential generator), they can derive secret keys or break session security. This undermines the entire cryptographic system regardless of the algorithm strength.

What should I do if I get this SSCP question wrong?

Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.

What is the key concept behind this question?

Read the scenario before looking for a memorised answer.

About these practice questions

Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →

How Courseiva writes practice questions · Editorial policy

Keep practising

More SSCP practice questions

Last reviewed: Jun 30, 2026

Question Discussion

Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.

Loading comments…

Sign in to join the discussion.

This SSCP practice question is part of Courseiva's free ISC2 certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the SSCP exam.