- A
It ensures that the private key d is small
Why wrong: e does not influence d size; d is computed from e and φ(n).
- B
It prevents side-channel attacks
Why wrong: Side-channel attacks are mitigated by constant-time algorithms, not exponent choice.
- C
It provides the highest security level
Why wrong: Security depends on key size, not exponent value within reason.
- D
It offers a balance between security and performance due to low Hamming weight
Few 1 bits speed up modular exponentiation.
Quick Answer
The correct answer is that 65537 offers a balance between security and performance due to its low Hamming weight. This specific exponent, represented in binary as 10000000000000001, has only two bits set, which dramatically reduces the number of multiplications required during modular exponentiation compared to a random large exponent, making encryption and signature verification significantly faster while still providing strong cryptographic strength. On the Systems Security Certified Practitioner SSCP exam, this question tests your understanding of how RSA parameters are chosen to optimize real-world efficiency without compromising security—a common trap is assuming a larger exponent always means better security, when in fact the security gain is negligible beyond 65537. To remember this, think of 65537 as the “two-bit wonder”: its binary form has exactly two 1s, giving you speed and security in one compact package.
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.
In RSA, the public exponent e is often chosen as 65537. What is the primary reason for this choice?
Clue words in this question
Noticing these words before you look at the options changes how you read each choice.
Clue:
"primary"Why it matters: Asks for the main purpose or function, not a secondary benefit. Eliminate answers that describe side-effects or partial functions.
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
It offers a balance between security and performance due to low Hamming weight
Option D is correct because 65537 (0x10001) has a low Hamming weight of only 2 bits set, which makes modular exponentiation significantly faster than using a random large exponent, while still providing strong security. This choice balances computational efficiency with cryptographic strength, as a larger exponent would slow down encryption without proportional security gains.
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.
- ✗
It ensures that the private key d is small
Why it's wrong here
e does not influence d size; d is computed from e and φ(n).
- ✗
It prevents side-channel attacks
Why it's wrong here
Side-channel attacks are mitigated by constant-time algorithms, not exponent choice.
- ✗
It provides the highest security level
Why it's wrong here
Security depends on key size, not exponent value within reason.
- ✓
It offers a balance between security and performance due to low Hamming weight
Why this is correct
Few 1 bits speed up modular exponentiation.
Clue confirmation
The clue word "primary" in the question point toward this answer.
Related concept
Read the scenario before looking for a memorised answer.
Common exam traps
Common exam trap: answer the scenario, not the keyword
ISC2 often tests the misconception that a larger exponent always means higher security, when in fact the exponent's size has negligible impact on security compared to the modulus length, and the real benefit of 65537 is performance due to its low Hamming weight.
Detailed technical explanation
How to think about this question
The exponent 65537 is the fourth Fermat prime (F4 = 2^16 + 1) and is commonly recommended in PKCS#1 v2.2 and FIPS 186-4 for RSA key generation. Its binary representation (10000000000000001) has only two 1-bits, reducing the number of squaring and multiplication operations in exponentiation from O(log e) to O(Hamming weight). In practice, this speeds up encryption and signature verification by roughly 30-50% compared to a random 64-bit exponent, while avoiding the vulnerabilities of very small exponents like 3 or 17.
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.
- →
Cryptography — study guide chapter
Learn the concepts, then practise the questions
- →
Cryptography practice questions
Targeted practice on this topic area only
- →
All SSCP questions
504 questions across all exam domains
- →
Systems Security Certified Practitioner SSCP study guide
Full concept coverage aligned to exam objectives
- →
SSCP practice test guide
How to use practice tests most effectively before exam day
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.
Risk Identification, Monitoring and Analysis practice questions
Practise SSCP questions linked to Risk Identification, Monitoring and Analysis.
Network and Communications Security practice questions
Practise SSCP questions linked to Network and Communications Security.
Systems and Application Security practice questions
Practise SSCP questions linked to Systems and Application Security.
Security Operations and Administration practice questions
Practise SSCP questions linked to Security Operations and Administration.
Incident Response and Recovery practice questions
Practise SSCP questions linked to Incident Response and Recovery.
Access Controls practice questions
Practise SSCP questions linked to Access Controls.
Cryptography practice questions
Practise SSCP questions linked to Cryptography.
SSCP fundamentals practice questions
Practise SSCP questions linked to SSCP fundamentals.
SSCP scenario practice questions
Practise SSCP questions linked to SSCP scenario.
SSCP troubleshooting practice questions
Practise SSCP questions linked to SSCP troubleshooting.
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: It offers a balance between security and performance due to low Hamming weight — Option D is correct because 65537 (0x10001) has a low Hamming weight of only 2 bits set, which makes modular exponentiation significantly faster than using a random large exponent, while still providing strong security. This choice balances computational efficiency with cryptographic strength, as a larger exponent would slow down encryption without proportional security gains.
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.
Are there clue words in this question I should notice?
Yes — watch for: "primary". Asks for the main purpose or function, not a secondary benefit. Eliminate answers that describe side-effects or partial functions.
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 →
Last reviewed: Jun 30, 2026
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.
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.
Sign in to join the discussion.