In an ECC key exchange, what do two parties exchange to derive a shared secret?

Their public keys, which are points on the curve

Their private keys, which are large integers

The curve parameters and the base point

In RSA key generation, what is the mathematical relationship between the public exponent e and the private exponent d?

d is the multiplicative inverse of e modulo φ(n)

d is the square root of e modulo n

d is equal to e raised to the power of φ(n)

d is the greatest common divisor of e and φ(n)

EC-CouncilCertified Encryption Specialist

Domain 3Objective 2

RSA, Elliptic Curve, DSA, and Elgamal ECES Practice Questions (Page 4)

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 16–20

16foundation · easy
In an ECC key exchange, what do two parties exchange to derive a shared secret?
Select an answer first
17application · medium
A security architect is selecting an asymmetric algorithm for a new authentication system that requires both encryption and digital signatures. The system must support hardware security modules (HSMs) and needs to minimize computational overhead. Which algorithm is the most balanced choice?
Select an answer first
18foundation · easy
In RSA key generation, what is the mathematical relationship between the public exponent e and the private exponent d?
Select an answer first
19application · medium
A developer is generating an RSA key pair for a new service. They have chosen two large primes p and q, and computed n = p*q. They now need to select a public exponent e. Which of the following choices is a valid and secure public exponent for this key pair?
Select an answer first
20foundation · easy
Which attack on RSA becomes feasible if the private exponent d is chosen to be very small?
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.

RSA, Elliptic Curve, DSA, and Elgamal ECES Practice Questions (Page 4)

Questions 16–20

In an ECC key exchange, what do two parties exchange to derive a shared secret?

A security architect is selecting an asymmetric algorithm for a new authentication system that requires both encryption and digital signatures. The system must support hardware security modules (HSMs) and needs to minimize computational overhead. Which algorithm is the most balanced choice?

In RSA key generation, what is the mathematical relationship between the public exponent e and the private exponent d?

A developer is generating an RSA key pair for a new service. They have chosen two large primes p and q, and computed n = p*q. They now need to select a public exponent e. Which of the following choices is a valid and secure public exponent for this key pair?

Which attack on RSA becomes feasible if the private exponent d is chosen to be very small?

Keep studying — Asymmetric Cryptography and Number Theory