Question: Question 1 _____________________ cryptography uses a single key to both encrypt and decrypt a file A. asymmetric-key B. public-key C. symmetric-key D. private-key Question 2

Question 1

_____________________ cryptography uses a single key to both encrypt and decrypt a file

A. asymmetric-key

B. public-key

C. symmetric-key

D. private-key

Question 2

There are _______ root certificate authorities (CAs) in the world, and all browsers must include their public keys.

A. 7

B. 20

C. 14

D. 8

Question 3

One of the great advantages of the Diffie-Hellman key exchange is that we can calculate a new shared secret for every connection. This means that if someone steals your private key, theyll be able to decrypt only past communications and not future ones. This is commonly known as __________________

A. future secrecy

B. reverse secrecy

C. backward secrecy

D. forward secrecy

Question 4

Servers use __________ rules to force browsers to use the HTTPS protocol exclusively

A. HTTP Symmetric Transport Security (HSTS)

B. HTTP Symmetric Transmission Security (HSTS)

C. HTTP Strict Transport Security (HSTS)

D. HTTP Strict Transmission Security (HSTS)

Question 5

TLS uses ______________ to verify messages

A. MACS

B. HMACs

C. TKLs

D. GPHs

Question 6

Before two parties can encrypt packets, they must compute a shared key. One way they can do that is with the _______________ key exchange algorithm.

A. Duffy-Schwartz

B. River-Caesar-Authentication (RCA)

C. Diffie-Hellman

D. Whitfeld-Gutiberg

Question 7

Researchers expect that quantum computers will someday be able to quickly calculate the _________, at which point these encryption algorithms will no longer be safe.

A. natural log

B. abstract log

C. discrete log

D. Euler Log

Question 8

For a certificate to be valid, the internets trusted public key infrastructure (PKI) must have signed it. The PKI is a collection of secure servers that sign and store certified copies of certificates.

A. True

B. False

Question 9

_________________ is a faster implementation of the Diffie-Hellman key exchange algorithm that achieves similar security with shorter keys.

A. General-curve Diffie-Hellman

B. Elliptic-curve Diffie-Hellman

C. Symmetric-curve Diffie-Hellman

D. Asymmetric-curve Diffie-Hellman

Question 10

openssl defaults to key sizes of ________________ bits

A. 6,144

B. 2,048

C. 3,072

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!