Home > CompTIA Security+ Certification > Quizzes > Cryptography Practice Test: Elliptic Curve Arithmetic/Cryptography
Cryptography Practice Test: Elliptic Curve Arithmetic/Cryptography
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 0% Most missed: “P = C1 – (d x C2) | Is this above stated formula true with respect to ECC?”

Elliptic curve cryptography (ECC) is a public key encryption technique that uses elliptic curves to create cryptographic keys. ECC is considered one of the most powerful types of cryptography in use today. 

ECC is based on the assumption that it is difficult to find the discrete logarithm of a random number. ECC uses modular arithmetic and group theory to deal with elliptic curves over finite fields. A finite field is a set of a certain number of numbers, which also includes infinity. 
 

Cryptography Practice Test: Elliptic Curve Arithmetic/Cryptography
Time left 00:00
1 Questions

1. In the elliptic curve group defined by y2= x3- 17x + 16 over real numbers, what is 2P if P = (4, 3.464)?