# TestOut Quiz 3.4

**Flashcard maker :**Lily Taylor

How many keys are used with asymmetric or public key cryptography?

Two

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. What must the receiver use to access the hashing value to verify the integrity of the transmission?

Sender’s public key

Which of the follow are characteristics of ECC? (Select two.)

Uses a finite set of values within an algebraic field

Asymmetric encryption

Asymmetric encryption

Which of the following algorithms are used in asymmetric encryption? (Select two.)

RSA

Diffie-Hellman

Diffie-Hellman

Above all else, what must be protected to maintain the security and benefit of an asymmetric cryptographic solution, especially if it is widely used for digital certificates?

Private keys

Which of the following generates the key pair used in asymmetric cryptography?

CSP

Mary wants to send a message to Sam so that only Sam can read it. Which key would be used to encrypt the message?

Sam’s public key

Mary wants to send a message to Sam. She wants to digitally sign the message to prove that she sent it. Which key would Mary use to create the digital signature?

Mary’s private key

The strength of a cryptosystem is dependent upon which of the following?

Secrecy of the key

Which form of asymmetric cryptography is based upon Diffie-Hellman?

El Gamal

Which cryptography system generates encryption keys that could be used with DES, AES, IDEA, RC5 or any other symmetric cryptography solution?

Diffie-Hellman

Match each public-key cryptography key management mechanism on the left with the corresponding description on the right. Each mechanism may be used once, more than once, or not at all.

Implements the Diffie-Hellman key exchange protocol using elliptic curve cryptography

Implements the Diffie-Hellman key exchange protocol using elliptic curve cryptography

ECDH

Match each public-key cryptography key management mechanism on the left with the corresponding description on the right. Each mechanism may be used once, more than once, or not at all.

Exist only for the lifetime of a specific communication session

Exist only for the lifetime of a specific communication session

Ephemeral keys

Match each public-key cryptography key management mechanism on the left with the corresponding description on the right. Each mechanism may be used once, more than once, or not at all.

Uses no deterministic algorithm when generating public keys

Uses no deterministic algorithm when generating public keys

Perfect forward secrecy

Match each public-key cryptography key management mechanism on the left with the corresponding description on the right. Each mechanism may be used once, more than once, or not at all.

Can be reused by multiple communication sessions

Can be reused by multiple communication sessions

Static keys