An agent wants to create fast and efficient cryptographic keys to use with Diffie-Hellman without
using prime numbers to generate the keys. Which of the following should be used?
A.
Elliptic curve cryptography
B.
Quantum cryptography
C.
Public key cryptography
D.
Symmetric cryptography
Can someone elaborate on the use of prime numbers in cryptography? It is, to my understanding, Symmetric encryption can make use out of prime numbers…
Symmetric cryptography can’t be the answer. I picked A, as in ECDHE for example.
The answer here is A ( ECC ), because it can make the DH key exchange without using prime numbers, and it is called ECDHE as Dugan Nash said, and “fast and efficient” was the trigger for the answer A here.