EC-CouncilCertified Encryption Specialist
Domain 3Objective 1
Number Theory and Mathematical Foundations ECES Practice Questions (Page 6)
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 44 practice questions to prepare you well beyond it. (estimate)
44questions here
9free pages
11concepts
Questions 26–30
- 26
A software engineer is implementing a checksum algorithm that computes (a + b) mod 10 for two single-digit inputs. The inputs are a = 7 and b = 8. What is the result?
Select an answer first - 27
A cryptographic protocol uses a modulus n = 15 and an exponent e = 7. To apply Euler's theorem, a developer needs to compute a^φ(n) mod n for any a coprime to n. What is the value of φ(15)?
Select an answer first - 28
Why are finite fields important in cryptography?
Select an answer first - 29
A security engineer is implementing a custom key-agreement protocol that requires two integers, a=252 and b=198, to be reduced to their smallest common unit. The protocol then needs the smallest positive integer that is a multiple of both a and b to size a lookup table. What are the GCD and LCM of 252 and 198?
Select an answer first - 30
If the GCD of two positive integers a and b is 4 and their product is 96, what is their LCM?
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.