MATH 5111 Final Exam Questions and Answers- Northeastern University
7 views 0 purchase
Course
MATH 5111
Institution
MATH 5111
MATH 5111 Final Exam Questions and Answers- Northeastern University
Question 1
10 out of 10 points
A strength of asymmetric algorithms when compared to symmetric algorithms is key
management (sharing keys with others while maintaining secrecy).
Selected Answer: True
Answers: True
False
...
Question 1 10 out of 10 points
A strength of asymmetric algorithms when compared to symmetric algorithms is key management (sharing keys with others while maintaining secrecy).
Selected Answer: True
Answers: True
False Question 2 10 out of 10 points
A strength of symmetric algorithms is that they have multiple modes.
Selected Answer: True
Answers: True
False Question 3 10 out of 10 points
A weakness of symmetric algorithms is that they are slow and easy to break.
Selected Answer: False
Answers: True False
Question 4 10 out of 10 points
An encryption machine used by the Germans during WW2. Selected Answer:
Enigma
Answers: Enigma
Turing
Purple
Ultra
Question 5 10 out of 10 points
Asymmetric algorithms are sometimes used for digital signature apllications.
Selected Answer: True
Answers: True
False Question 6 10 out of 10 points
Block ciphers more closely emulate one-time pads.
Selected Answer: False
Answers: True False
Question 7 10 out of 10 points
Caesar cipher and the Vigenere cipher are examples of symmetric algorithms.
Selected Answer: True
Answers: True
False Question 8 10 out of 10 points
Cipher Block Chaining (CBC) uses an initialization vector (IV) to add security.
Selected Answer: True
Answers: True
False Question 9 10 out of 10 points
Electronic Code Book (ECB) works well with block cyphers.
Selected Answer: True
Answers: True
False Question 10 80 out of 80 points
Identify which encryption method each statement relates to.
Question Correct Match Selected Match
Visible or invisible markings embedded within a digital file to indicate copyright or other handling instructions.
G. Digital Watermarking
G. Digital Watermarking
Also known as Vernam ciphers. D. One-time Pads
D. One-time Pads
Disguises a message by rearranging the letters (or bits) in the message.
E. Transpositions Ciphers
E. Transpositions Ciphers
Polyalphabetic cipher that uses a keyword rather than a number as the key.
C. Vigenère Ciphers
C. Vigenère Ciphers
A phrase is converted to a simple value.
F. Codes
F. Codes
A simple substitution cipher that uses multiple alphabets rather than just one.
B. Polyalphabetic Ciphers
B. Polyalphabetic Ciphers
Takes one piece of information and hides it within another.
H. Steganography
H. Steganography
Uses the numerical value of letters
in the plaintext and is coded and decoded by using a copy of the A. A.
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller VEVA2K. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $20.99. You're not tied to anything after your purchase.
