Question: Asymmetric encryption

Answer: An encryption method that uses two mathematically related keys called a key pair.

Question: Diffie-Hellman key exchange

Answer: The first asymmetric algorithm developed by Whitfield Diffie and Martin Hellman in 1976 that generates symmetric keys simultaneously at sender and recipient sites over non-secure channels.

Question: ElGamel

Answer: An asymmetric encryption system based on a discrete logarithm problem.

Question: Elliptic Curve Cryptography (ECC)

Answer: An asymmetric encryption system based on groups of numbers in an elliptical curve.

Question: Merkle-Hellman Knapsack

Answer: An asymmetric encryption system based on the subset sum problem (given a list of numbers and a sum, determine the subset used to create the sum).

Question: Rivest Shamir Adleman (RSA)

Answer: An asymmetric encryption system based on factoring large numbers into their prime values.

Question: How many keys are used with asymmetric (public key) cryptography?

Answer: Two

Question: A receiver wants to verify the integrity of a message received from a sender. A hashing value is contained within the digital signature of the sender.

Which of the following must the receiver use the access the hashing value and verify the integrity of the transmission?

Answer: Sender’s public key

Question: Which of the following are characteristics of ECC? (select two)

Answer: Asymmetric encryption

Uses a finite set of values within an algebraic field

Question: Which of the following algorithms are used in asymmetric encryption? (select two)

Answer: RSA

Diffie-Hellman