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…
0
0
Symmetric cryptography can’t be the answer. I picked A, as in ECDHE for example.
1
0
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.
1
0
agreed the answer is A
Elliptic Curve Diffie-Hellman Ephemeral (ECDHE) is a version of Diffie-Hellman that uses ECC to recreate keys for each session. Elliptic Curve Diffie-Hellman Ephemeral (ECDHE) allows entities to negotiate encryption keys securely over a public network. anonymous key agreement protocol . Diffie-Hellman key exchange (D-H) is a means of securely generating symmetric encryption keys across an insecure medium.
1
0