Public-Key Cryptography & Message Authentication

Message authentication primarily protects against which kind of attack?

A one-way hash function takes a variable-size message and produces:

Which hash property means: given h, it is infeasible to find x with H(x)=h?

SHA-1 produces a hash value of what size?

What does the secret key add when used in HMAC (vs a plain hash)?

In the MAC process, what is NOT sent across the network with the message?

'Authenticated encryption' (e.g., CCM) provides:

Public-key encryption was first publicly proposed by:

Bob receives a message with a digital signature that claims to be from Alice. Which key does Bob use to VERIFY the signature?

The main advantage of ECC compared to RSA is:

Message integrity means the data arrives exactly as it was transmitted, with no changes.

Authenticating a message without encrypting it also provides confidentiality.

A collision-resistant hash makes it infeasible to find any two inputs with the same hash.

To sign a message, the sender encrypts the message's hash value with its private key.

A digital signature is verified using the sender's private key.

Public-key encryption has made conventional (symmetric) encryption obsolete.

Diffie-Hellman can be used both for encrypting messages and for key exchange.

RSA can be used for both encryption and digital signatures.

The Digital Signature Algorithm (DSA) can also be used for encryption and key exchange.

In HMAC, both the message and a secret key are inputs to the hash.

Match each hash property with its meaning.

Match each public-key application with the key used.

Match each algorithm with a key fact.

Match each hash standard with a fact.

Match each digital-signature standard concept.