EC-CouncilCertified Encryption Specialist
Domain 3Objective 2
RSA, Elliptic Curve, DSA, and Elgamal ECES Practice Questions (Page 2)
Part of the Asymmetric Cryptography and Number Theory domain, which makes up ~17% of our current practice bank. EC-Council does not publish an official question count, but from its 120-minute exam (~50–80 total, ~9–14 in this domain), expect 3–5 from this objective — we provide 43 practice questions to prepare you well beyond it. (estimate)
43questions here
9free pages
11concepts
Questions 6–10
- 6
A security auditor discovers that an organization's RSA key pair has a public exponent of 3 and is used across multiple systems with the same modulus but different messages. Which attack is the auditor most likely concerned about?
Select an answer first - 7
In Elgamal encryption, what is the public key?
Select an answer first - 8
A software company wants to sign software updates with a digital signature scheme that offers fast verification and small signatures. Which of the following algorithms is the most appropriate choice?
Select an answer first - 9
A developer is implementing ECC point multiplication on a curve over a finite field. The developer needs to compute kP for a large scalar k. Which algorithm is most efficient for this operation?
Select an answer first - 10
In ECC-based key exchange, what is the analogy to the discrete logarithm problem in traditional Diffie-Hellman?
Select an answer first
Finished these 5 questions?
Review the revealed explanations, or continue through the curriculum.
Free Basic Practice is a study aid with revealable answers — not a scored exam. Examers.io is independent and not affiliated with or endorsed by EC-Council. “ECES” is a trademark of its owner, used for identification only.