# Course: CS 585 03f
#######################################
:TYPE:MC:N:1:C
:TITLE: Permutation
:QUESTION:H
Which of the following cipher(s) use permutation as part the
enciphering process?
:ANSWER1:100:T
ADFGVX
:ANSWER2:-33:T
Caeser
:ANSWER3:-33:T
Playfair
:ANSWER4:-33:T
Vigenere
:CAT:test4_mc
#######################################
:TYPE:MC:1:0:C
:TITLE: One time pad
:QUESTION:H
Using a one time pad will provide what level of security?
:ANSWER1:0:T
empirically
:ANSWER2:0:T
provably
:ANSWER3:100:T
unconditional
:ANSWER4:0:T
zero, it is not secure
:CAT:test4_mc
#######################################
:TYPE:MC:1:0:C
:TITLE: Nonces
:QUESTION:H
If a nonce has a size of n bits, how many nonces could be generated with a good random number generator before a repetition would be expected?
:ANSWER1:0:T
n raised to the power of 2
:ANSWER2:0:T
n
:ANSWER3:0:T
the logarithm base 2 of n divided by 2
:ANSWER4:100:T
the square root of n raised to the power of 2
:CAT:test4_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: RSA
:QUESTION:H
The RSA algorithm has which of the following properties?
:ANSWER1:-50:T
uses a public key
:ANSWER2:50:T
does not use a public key
:ANSWER3:-50:T
is based on nth root factorization
:ANSWER4:50:T
is based on prime factorization
:CAT:test4_mc
#######################################
:TYPE:MC:1:0:C
:TITLE: Pohlig Hellman
:QUESTION:H
In the context of the Pohlig Hellman cipher a generator is
:ANSWER1:0:T
a function that create a random number
:ANSWER2:0:T
a function that creates a sequence of keys
:ANSWER3:100:T
a number relatively prime to the size of the modulo number space
:ANSWER4:0:T
irrelevant to this cipher
:CAT:test4_mc
#######################################
:TYPE:MC:1:0:C
:TITLE: Neural Networks
:QUESTION:H
We discussed how neural networks could be used in which of the
following phases of cryptography
:ANSWER1:0:T
authentication
:ANSWER2:0:T
decoding
:ANSWER3:0:T
encoding
:ANSWER4:100:T
key distribution
:CAT:test4_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Auto keying
:QUESTION:H
Auto keying has which of the following properties
:ANSWER1:-50:T
provides backward security
:ANSWER2:50:T
provides forward security
:ANSWER3:50:T
is a function of the previous key and other information
:ANSWER4:-50:T
is a function of the previous key only
:CAT:test4_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Feistel
:QUESTION:H
Check the following (if any) cipher(s) that are
use a feistel structure.
:ANSWER1:-50:T
AES
:ANSWER2:50:T
DES
:ANSWER3:-50:T
Hill
:ANSWER4:50:T
Triple DES
:CAT:test4_mc
#######################################
:TYPE:MC:1:0:C
:TITLE: Message Authentication Codes
:QUESTION:H
A message authentication code is concerned with which of
the following security properties?
:ANSWER1:0:T
accessibility
:ANSWER2:0:T
authentication
:ANSWER3:0:T
confidentiality
:ANSWER4:0:T
integrity
:CAT:test4_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Public Key Crypto
:QUESTION:H
Public key cryptography and symmetric key cryptography can be
used together, which is the most likely combination
:ANSWER1:50:T
public key used for interchange key
:ANSWER2:-50:T
public key used for session key
:ANSWER3:-50:T
symmetric key used for interchange key
:ANSWER4:50:T
symmetric key used for session
:CAT:test4_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Diffie Hellman properties
:QUESTION:H
Which of the following (if any) are properties of the Diffie-Hellman cipher?
:ANSWER1:-33:T
each participant needs more than 2 large primes
:ANSWER2:100:T
each participant needs no more than 2 large primes
:ANSWER3:-33:T
needs secure exchange of keys
:ANSWER4:-33:T
is computed over the reals
:CAT:test4_mc
#######################################
:TYPE:P
:TITLE: Playfair
:QUESTION:H:60:30
Describe what changes would need to be made to the playfair cipher for it to be able to encode seven bit ASCII messages.
:CAT:test4_p
#######################################
:TYPE:P
:TITLE: DES
:QUESTION:H:60:30
Outline how the keys in the key schedule are generated. Why is a key schedule necessary?
:CAT:test4_p
#######################################
:TYPE:P
:TITLE: Public key cryptography
:QUESTION:H:60:30
Describe the steps necessary for someone to send a message to you using a public key cryptography product, e.g. gpg. Describe how public key cryptography addresses the issues of authentication, confidentiality, and integrity.
:CAT:test4_p
#######################################
:TYPE:MC:1:1:C
:TITLE: Can Steal V
:QUESTION:H
Consider the image shown 
, what must be true for
V to steal c over Y.
:ANSWER1:-25:T
A must contain t
:ANSWER2:-25:T
A must contain g
:ANSWER3:-25:T
is possible no conditions necessary
:ANSWER4:100:T
not possible
:ANSWER5:-25:T
X must be a subject
:CAT:test4b_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Bell LaPadula Dual
:QUESTION:H
Which model is referred to as the dual of the Bell LaPadula model?
:ANSWER1:100:T
Biba
:ANSWER2:-25:T
Chinese Wall
:ANSWER3:-25:T
Clark Wilson
:ANSWER4:-25:T
Schematic Protection
:CAT:test4b_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Chinese Wall properties
:QUESTION:H
Which of the following is true for the chinese wall model
:ANSWER1:-25:T
reading and writing are equivalent
:ANSWER2:-25:T
reading and writing are equivalent for sanitized objects
:ANSWER3:-25:T
reading implies the ability to write to an object
:ANSWER4:100:T
writing implies the ability to read from an object
:CAT:test4b_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Covert Channels
:QUESTION:H
Non interference and non deducibility are both ways of addressing the existence of covert channel. Which of the following (if any) are true?
:ANSWER1:-50:H
if a system has non deducibility then it has non interference
:ANSWER2:100:H
if a system has non interference then it has non deducibility
:ANSWER3:-50:H
non deducibility prevents someone from receiving on a covert channel
:ANSWER4:-50:H
non deducibility prevents someone from sending on a covert channel
:ANSWER5:-50:H
non interference prevents someone from sending on a covert channel
:CAT:test4b_mc
#######################################
:TYPE:MC:N:1:C
:TITLE: Bell LaPadula Writing
:QUESTION:H
Under the Bell LaPadula model and the image shown 
. Which classification levels could a user be at and be able to write an object that will have a classification level of Alpha, Public:
:ANSWER1:50:T
Alpha, Public
:ANSWER2:-50:T
Alpha, Secret
:ANSWER3:50:T
Beta, WWW
:ANSWER4:-50:T
Beta, Confidential
:ANSWER5:-50:T
Beta, Top Secret
:ANSWER6:-50:T
Gamma, Public
:ANSWER7:-50:T
Gamma, Secret
:CAT:test4b_mc