[Sep 07, 2022] Get Latest and 100% Accurate 212-81 Exam Questions [Q90-Q113]

NO.90 Which one of the following is an authentication method that sends the username and password in cleartext?

NO.91 How did the ATBASH cipher work?

NO.92 Which one of the following is an example of a symmetric key algorithm?

NO.93 Storing private keys with a third party is referred to as what?

NO.94 John works as a cryptography consultant. He finds that people often misunderstand the reality of breaking a cipher. What is the definition of breaking a cipher?

NO.95 If the round function is a cryptographically secure pseudorandom function, then ___rounds is sufficient to make it a “strong” pseudorandom permutation.

NO.96 A ______ refers to a situation where two different inputs yield the same output.

NO.97 The greatest weakness with symmetric algorithms is _____.

NO.98 A protocol for key aggreement based on Diffie-Hellman. Created in 1995. Incorporated into the public key standard IEEE P1363.

NO.99 All of the following are key exchange protocols except for____

NO.100 Changing some part of the plain text for some matching part of cipher text. Historical algorithms typically use this.

NO.101 Ferris has been assigned the task of selecting security for his company’s wireless network. It is important that he pick the strongest form of wireless security. Which one of the following is the strongest wireless security?

NO.102 What is the largest key size that AES can use?

NO.103 Asymmetric encryption method developed in 1984. It is used in PGP implementations and GNU Privacy Guard Software. Consists of 3 parts: key generator, encryption algorithm, and decryption algorithm.

NO.104 A _____ is a function is not reversible.

NO.105 Manipulating individuals so that they will divulge confidential information, rather than by breaking in or using technical cracking techniques.

NO.106 An authentication method that periodically re-authenticates the client by establishing a hash that is then resent from the client is called ______.

NO.107 A _____ is a function that takes a variable-size input m and returns a fixed-size string.

NO.108 What is Kerchoff’s principle?

NO.109 When learning algorithms, such as RSA, it is important to understand the mathematics being used. In RSA, the number of positive integers less than or equal to some number is critical in key generation. The number of positive integers less than or equal to n that are coprime to n is called ______.

NO.110 A real time protocol for verifying certificates (and a newer method than CRL).

NO.111 Which one of the following best describes a process that splits the block of plaintext into two separate blocks, then applies the round function to one half, and finally swaps the two halves?

NO.112 Which of the following is a cryptographic protocol that allows two parties to establish a shared key over an insecure channel?

NO.113 3DES can best be classified as which one of the following?