EC-CouncilCertified Encryption Specialist
Domain 3Objective 1
Number Theory and Mathematical Foundations ECES Practice Questions (Page 3)
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 11–15
- 11
What is the result of (17 + 25) mod 7?
Select an answer first - 12
A system administrator is configuring a round-robin load balancer that cycles through two services with periods of 12 seconds and 18 seconds. The administrator needs to know the shortest interval after which both services start their cycles simultaneously. What is this interval?
Select an answer first - 13
Which of the following numbers is a prime number?
Select an answer first - 14
A developer is implementing a custom encryption scheme that requires the multiplicative inverse of a modulo n. The developer computes GCD(a,n) and finds it is 1. Which of the following statements is true?
Select an answer first - 15
Which of the following numbers has a multiplicative inverse modulo 10?
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.