ExamGecko
Home Home / ECCouncil / 212-81

ECCouncil 212-81 Practice Test - Questions Answers, Page 21

Question list
Search
Search

Related questions











Represents the total number of possible values of keys in a cryptographic algorithm or other security measure, such as a password.

A.
Key Schedule
A.
Key Schedule
Answers
B.
Key Clustering
B.
Key Clustering
Answers
C.
Key Space
C.
Key Space
Answers
D.
Key Exchange
D.
Key Exchange
Answers
Suggested answer: C

Explanation:

Key Space

https://en.wikipedia.org/wiki/Key_space_(cryptography)

Algorithm's key space refers to the set of all possible permutations of a key.

To prevent an adversary from using a brute-force attack to find the key used to encrypt a message, the key space is usually designed to be large enough to make such a search infeasible. On average, half the key space must be searched to find the solution.

Another desirable attribute is that the key must be selected truly randomly from all possible key permutations. Should this not be the case, and the attacker is able to determine some factor that may influence how the key was selected, the search space (and hence also the search time) can be significantly reduced. Humans do not select passwords randomly, therefore attackers frequently try a dictionary attack before a brute force attack, as this approach can often produce the correct answer in far less time than a systematic brute force search of all possible character combinations.

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

A.
Digital signature
A.
Digital signature
Answers
B.
Symmetric algorithm
B.
Symmetric algorithm
Answers
C.
Asymmetric algorithm
C.
Asymmetric algorithm
Answers
D.
Hashing algorithm
D.
Hashing algorithm
Answers
Suggested answer: B

Explanation:

Symmetric algorithm

https://en.wikipedia.org/wiki/Triple_DES

Triple DES (3DES or TDES), officially the Triple Data Encryption Algorithm (TDEA or Triple DEA), is a symmetric-key block cipher, which applies the DES cipher algorithm three times to each data block. The Data Encryption Standard's (DES) 56-bit key is no longer considered adequate in the face of modern cryptanalytic techniques and supercomputing power. However, an adapted version of DES, Triple DES (3DES), uses the same algorithm to produce a more secure encryption.

Denis is looking at an older system that uses DES encryption. A colleague has told him that DES is insecure due to a small key size. What is the key length used for DES?

A.
128
A.
128
Answers
B.
256
B.
256
Answers
C.
56
C.
56
Answers
D.
64
D.
64
Answers
Suggested answer: C

Explanation:

56

https://en.wikipedia.org/wiki/DES

The Data Encryption Standard is a symmetric-key algorithm for the encryption of digital data. Although its short key length of 56 bits makes it too insecure for applications, it has been highly influential in the advancement of cryptography.

You have been tasked with selecting a digital certificate standard for your company to use. Which one of the following was an international standard for the format and information contained in a digital certificate?

A.
CA
A.
CA
Answers
B.
X.509
B.
X.509
Answers
C.
CRL
C.
CRL
Answers
D.
RFC 2298
D.
RFC 2298
Answers
Suggested answer: B

Explanation:

X 509 https://en.wikipedia.org/wiki/X.509

X 509 is a standard defining the format of public key certificates. X.509 certificates are used in many Internet protocols, including TLS/SSL, which is the basis for HTTPS, the secure protocol for browsing the web. They are also used in offline applications, like electronic signatures. An X.509 certificate contains a public key and an identity (a hostname, or an organization, or an individual), and is either signed by a certificate authority or self-signed. When a certificate is signed by a trusted certificate authority, or validated by other means, someone holding that certificate can rely on the public key it contains to establish secure communications with another party, or validate documents digitally signed by the corresponding private key.


This algorithm was published by the German engineering firm Seimans in 1993. It is a software based stream cipher using Lagged Fibonacci generator along with a concept borrowed from the shrinking generator ciphers.

A.
RC4
A.
RC4
Answers
B.
Blowfish
B.
Blowfish
Answers
C.
Twofish
C.
Twofish
Answers
D.
FISH
D.
FISH
Answers
Suggested answer: D

Explanation:

FISH

https://en.wikipedia.org/wiki/FISH_(cipher)

The FISH (FIbonacci SHrinking) stream cipher is a fast software based stream cipher using Lagged Fibonacci generators, plus a concept from the shrinking generator cipher. It was published by Siemens in 1993. FISH is quite fast in software and has a huge key length. However, in the same paper where he proposed Pike, Ross Anderson showed that FISH can be broken with just a few thousand bits of known plaintext.

What does Output feedback (OFB) do:

A.
The message is divided into blocks and each block is encrypted separately. This is the most basic mode for symmetric encryption
A.
The message is divided into blocks and each block is encrypted separately. This is the most basic mode for symmetric encryption
Answers
B.
The cipher text from the current round is XORed with the plaintext from the previous round
B.
The cipher text from the current round is XORed with the plaintext from the previous round
Answers
C.
A block cipher is converted into a stream cipher by generating a keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext
C.
A block cipher is converted into a stream cipher by generating a keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext
Answers
D.
The cipher text from the current round is XORed with the plaintext for the next round
D.
The cipher text from the current round is XORed with the plaintext for the next round
Answers
Suggested answer: C

Explanation:

A block cipher is converted into a stream cipher by generating a keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext

https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation#Output_feedback_(OFB)

The output feedback (OFB) mode makes a block cipher into a synchronous stream cipher. It generates keystream blocks, which are then XORed with the plaintext blocks to get the ciphertext. Just as with other stream ciphers, flipping a bit in the ciphertext produces a flipped bit in the plaintext at the same location. This property allows many error-correcting codes to function normally even when applied before encryption.

Total 206 questions
Go to page: of 21