EC-CouncilCertified Encryption Specialist
Domain 3Objective 1
Number Theory and Mathematical Foundations ECES Practice Questions (Page 7)
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 31–35
- 31
What is the value of (8 × 9) mod 5?
Select an answer first - 32
Using Fermat's little theorem, what is the value of 3^6 mod 7?
Select an answer first - 33
A cryptographer is designing a public-key system based on modular exponentiation. The modulus is n = 35. To compute the private exponent, the cryptographer needs the size of the multiplicative group modulo n. What is the value of Euler's totient function φ(35)?
Select an answer first - 34
What is the least common multiple (LCM) of 12 and 18?
Select an answer first - 35
A network engineer is designing a scheduling system for two recurring maintenance windows: one every 14 days and another every 21 days. The engineer needs to find the least number of days after which both windows coincide. What is this interval?
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.