A cryptographic library supports operations in GF(p) and GF(2^m). A developer is choosing between them for an elliptic-curve implementation. Which statement correctly contrasts the two fields?

GF(p) is a finite field, but GF(2^m) is not

GF(p) supports only addition, while GF(2^m) supports multiplication

GF(2^m) requires a prime modulus, while GF(p) does not

GF(p) uses arithmetic modulo a prime p, while GF(2^m) uses polynomial arithmetic modulo an irreducible polynomial

EC-CouncilCertified Encryption Specialist

Domain 3Objective 1

Number Theory and Mathematical Foundations ECES Practice Questions (Page 5)

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 21–25

21expert · medium
A cryptographic library supports operations in GF(p) and GF(2^m). A developer is choosing between them for an elliptic-curve implementation. Which statement correctly contrasts the two fields?
Select an answer first
22application · easy
A developer is writing a primality-checking routine for a key-generation tool. The routine must identify which of the following numbers is prime, because it will be used as a modulus in a cryptographic algorithm. Which number is prime?
Select an answer first
23application · easy
A network protocol uses two timers with periods of 18 seconds and 24 seconds. The protocol must find the smallest interval after which both timers fire simultaneously. What is that interval?
Select an answer first
24foundation · easy
What is the prime factorization of 84?
Select an answer first
25expert · easy
A software developer is implementing a hash function that uses modular multiplication. The function computes (a * b) mod 12. For a = 7 and b = 5, what is the result?
Select an answer first

Finished these 5 questions?

Review the revealed explanations, or continue through the curriculum.

Next 5 questions →Back to ECES

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.

Number Theory and Mathematical Foundations ECES Practice Questions (Page 5)

Questions 21–25

A cryptographic library supports operations in GF(p) and GF(2^m). A developer is choosing between them for an elliptic-curve implementation. Which statement correctly contrasts the two fields?

A developer is writing a primality-checking routine for a key-generation tool. The routine must identify which of the following numbers is prime, because it will be used as a modulus in a cryptographic algorithm. Which number is prime?

A network protocol uses two timers with periods of 18 seconds and 24 seconds. The protocol must find the smallest interval after which both timers fire simultaneously. What is that interval?

What is the prime factorization of 84?

A software developer is implementing a hash function that uses modular multiplication. The function computes (a * b) mod 12. For a = 7 and b = 5, what is the result?

Keep studying — Asymmetric Cryptography and Number Theory