is the scrambled message produced as output.

A$.$ Plaintext

B$.$ Ciphertext

C$.$ Secret key

D$.$ Cryptanalysis

On average,

of all possible keys must be tried in order to achieve success with a brute$-$force

attack.

$(1)$

A$.$ one$-$fourth

B$.$ half

C$.$ two$-$thirds

D$.$ three$-$fourths

If the only form of attack that could be made on an encryption algorithm is brute$-$force, then the way to

counter such attacks would be to

$(1)$

A$.$ use longer keys

B$.$ use shorter keys

C$.$ use more keys

D$.$ use less keys

Document access mode

The exact substitutions and transformations performed by the algorithm depend on the

$(1)$

A$.$ ciphertext

B$.$ decryption algorithm

C$.$ secret key

D$.$ encryption algorithm

If the analyst is able to get the source system to insert into the system a message chosen by the analyst, then

a

attack is possible.

A$.$ known$-$plaintext

B$.$ chosen$-$plaintext

C$.$ chosen ciphertext

D$.$ chosen text

There are

modes of operation defined by NIST that are intended to cover virtually all the possible

applications of encryption for which a block cipher could be used.

$(1)$

A$.$ three

B$.$ five

C$.$ seven

D$.$ nine