Deck 3: Classical Encryption Techniques

Question 1

the algorithm will produce a different output depending on the
specific secret key being used at the time.the exact substitutions
and transformations performed by the algorithm depend on the
key.

Answer 1

True

Question 2

Restoring the plaintext from the ciphertext is __________ .

A) deciphering
B) transposition
C) steganography
D) encryption

Answer 2

A

Question 3

the process of converting from plaintext to ciphertext is known as
deciphering or decryption.

Answer 3

False

Question 4

__________ techniques map plaintext elements (characters, bits) into ciphertext elements.

A) Transposition
B) Substitution
C) Traditional
D) Symmetric

Question 5

Steganography renders the message unintelligible to outsiders by
various transformations of the text.

Question 6

An original intelligible message fed into the algorithm as input is known as _________ , while the coded message produced as output is called the __________ .

A) decryption, encryption
B) plaintext, ciphertext
C) ciphertext, plaintext
D) encryption, decryption

Question 7

A __________ attack involves trying every possible key until an intelligible translation of the ciphertext is obtained.

A) brute-force
B) Caesar attack
C) ciphertext only
D) chosen plaintext

Question 8

Ciphertext generated using a computationally secure encryption
scheme is impossible for an opponent to decrypt simply because
the required information is not there.

Question 9

A scheme known as a one-time pad is unbreakable because it
produces random output that bears no statistical relationship to
the plaintext.

Question 10

Monoalphabetic ciphers are easy to break because they reflect the
frequency data of the original alphabet.

Question 11

As with Playfair, the strength of the Hill cipher is that it
completely hides single letter frequencies.

Question 12

When using symmetric encryption it is very important to keep the
algorithm secret.

Question 13

the most widely used cipher is the Data Encryption Standard.

Question 14

Joseph Mauborgne proposed an improvement to the Vernam cipher that uses a random key that is as long as the message so that the key does not need to be repeated.the key is used to encrypt and decrypt a single message and then is discarded.Each new message requires a new key of the same length as the new message.this scheme is known as a(n) __________ .

A) pascaline
B) one-time pad
C) polycipher
D) enigma

Question 15

Symmetric encryption is a form of cryptosystem in which
encryption and decryption are performed using different keys.It is
also known as non-conventional encryption.

Question 16

Symmetric encryption remains by far the most widely used of the
two types of encryption.

Question 17

On average, half of all possible keys must be tried to achieve
success with a brute-force attack.

Question 18

With the use of symmetric encryption, the principal security
problem is maintaining the secrecy of the key.

Question 19

the one-time pad has unlimited utility and is useful primarily for
high-bandwidth channels requiring low security.

Question 20

Rotor machines are sophisticated precomputer hardware devices
that use substitution techniques.

Question 21

__________ encryption is a form of cryptosystem in which encryption and decryption are performed using the same key.

Question 22

An encryption scheme is said to be __________ if the cost of breaking the cipher exceeds the value of the encrypted information and the time required to break the cipher exceeds the useful lifetime of the information.

Question 23

the ___________ takes the ciphertext and the secret key and produces the original plaintext.It is essentially the encryption algorithm run in reverse.

A) Voronoi algorithm
B) decryption algorithm
C) cryptanalysis
D) diagram algorithm

Question 24

Cryptographic systems are characterized along three independent dimensions: the type of operations used for transforming plaintext to ciphertext; the way in which the plaintext is processed; and __________ .

Question 25

One of the simplest and best known polyalphabetic ciphers is _________ cipher.In this scheme, the set of related monoalphabetic substitution rules consists of the 26 Caesar ciphers with shifts of 0 through 25.Each cipher is denoted by a key letter which is the ciphertext letter that substitutes for the plaintext letter
A.

Question 26

If both sender and receiver use the same key, the system is referred to as:

A) public-key encryption
B) two-key
C) asymmetric
D) conventional encryption

Question 27

the __________ was used as the standard field system by the British Army in World War I and was used by the U.S.Army and other Allied forces during World War II.

A) Caesar cipher
B) Playfair cipher
C) Hill cipher
D) Rail Fence cipher

Question 28

A way to improve on the simple monoalphabetic technique is to use different monoalphabetic substitutions as one proceeds through the plaintext
Message.the general name for this approach is ___________ .

A) rail fence cipher
B) cryptanalysis
C) polyalphabetic substitution cipher
D) polyanalysis cipher

Question 29

A __________ cipher processes the input one block of elements at a time, producing an output block for each input block, whereas a stream cipher processes the input
elements continuously, producing output one element at a time.

Question 30

techniques used for deciphering a message without any knowledge of the enciphering details is ___________ .

A) blind deciphering
B) steganography
C) cryptanalysis
D) transposition

Question 31

All encryption algorithms are based on two general principles: substitution and
____________ .

Question 32

__________ attacks exploit the characteristics of the algorithm to attempt to deduce a specific plaintext or to deduce the key being used.

A) Brute-force
B) Cryptanalytic
C) Block cipher
D) Transposition

Question 33

the __________ attack is the easiest to defend against because the opponent has the least amount of information to work with.

A) ciphertext-only
B) chosen ciphertext
C) known plaintext
D) chosen plaintext

Question 34

the earliest known, and simplest use, of a substitution cipher was called the __________ cipher and involved replacing each letter of the alphabet with the letter standing three places further down the alphabet.

Question 35

_________ refer to common two-letter combinations in the English language.

A) Streamings
B) Transpositions
C) Digrams
D) Polyalphabetic ciphers

Question 36

An encryption scheme is __________ secure if the ciphertext generated by the scheme does not contain enough information to determine uniquely the corresponding plaintext, no matter how much ciphertext is available.

Question 37

A technique for hiding a secret message within a larger document or picture in such a way that others cannot discern the presence or contents of the hidden message is __________ .

Question 38

the two types of attack on an encryption algorithm are cryptanalysis, based on properties of the encryption algorithm, and _________ which involves trying all possible keys.

Question 39

A technique referred to as a __________ is a mapping achieved by performing some sort of permutation on the plaintext letters.

A) transposition cipher
B) polyalphabetic cipher
C) Caesar cipher
D) monoalphabetic cipher

Question 40

the methods of __________ conceal the existence of the message in a graphic image.

A) steganography
B) decryptology
C) cryptology
D) cryptography

Question 41

the most widely used cipher ever is the __________ .

Question 42

the __________ consist of a set of independently rotating cylinders through which
electrical pulses can flow.Each cylinder has 26 input pins and 26 output pins with internal wiring that connects each input pin to a unique output pin.

Question 43

the simplest transposition cipher is the _________ technique, in which the plaintext is written down as a sequence of diagonals and then read off as a sequence of rows.

Question 44

the best known multiple letter encryption cipher is the __________ , which treats digrams in the plaintext as single units and translates these units into ciphertext digrams.

Question 45

the task of making large quantities of random keys on a regular basis and distributing a key of equal length to both sender and receiver for every message sent are difficulties of the __________ scheme.