Question 1 (2 ✔Listen ► The phrase "BLACK HAT" was encrypted using a shift cipher, resulting in the cipher text "WGVXFCVO". Select all the shift ciphers that could have been used to encrypt the phrase. f(p) = (p +21) mod 26 f(p) = (p - 5) mod 26 f(p) = (p+19) mod 26 Of(p) = (p-31) mod 26 Question 2 ( Listen Select all the keys (a, b) that make the affine transformation f(p) = (ap + b) mod 26 valid. (1,26) [](7,-5) (13, 9) (50, 3) Question 3 (. Listen ► Encrypt the message "REDS HACKED BLUES" using the block cipher defined by • σ(1) = 3 • σ(2) = 5 . • σ(3) = 1 • σ(4) = 7 • σ(5) = 2 • σ(6) = 4 • σ(7) = 6 Type your answer using UPPERCASE, and omit spaces. Question 4 (2 Listen True or False: "The receiver of a message encrypted with RSA key (n = p*q, e) knows what the integers p and q are." True False Question 5 ✔Listen Which of the following is the decryption function for the RSA key (8633, 13)? HINT: 8633= 97*89 O A/ O 3317 f¹(c) = c³3¹7 mod 8624 f¹(c) = c³3¹7 mod 8633 f¹(c) = c¹3 mod 8633 f-¹(c) = c³217 mod 8624

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Show explanation please

Question 1
Listen
The phrase "BLACK HAT" was encrypted using a shift cipher, resulting in the cipher
text "WGVXFCVO". Select all the shift ciphers that could have been used to encrypt
the phrase.
f(p) = (p+21) mod 26
f(p) = (p-5) mod 26
|f(p) = (p+19) mod 26
|f(p) = (p-31) mod 26
Question 2 (
✔) Listen ►
Select all the keys (a, b) that make the affine transformation f(p) = (ap + b) mod 26
valid.
(1,26)
(7,-5)
[(13,9)
(50, 3)
Question 3 (
✔Listen
Encrypt the message "REDS HACKED BLUES" using the block cipher defined by
• σ(1) = 3
• σ(2) = 5
• σ(3) = 1
• σ(4)=7
• σ(5)=2
• σ(6) = 4
• σ(7) = 6
Type your answer using UPPERCASE, and omit spaces.
Question 4 (2
◄ Listen ▶
A/
True or False: "The receiver of a message encrypted with RSA key (n = p*q, e) knows
what the integers p and q are."
True
False
Question 5 (2
Listen ►
Which of the following is the decryption function for the RSA key (8633, 13)?
HINT: 8633 = 97*89
3317
f-¹(c) = c³3¹7 mod 8624
f¹(c) = c3317
mod 8633
f¹(c) c¹3 mod 8633
=
f¹(c)=c³217 mod 8624
Transcribed Image Text:Question 1 Listen The phrase "BLACK HAT" was encrypted using a shift cipher, resulting in the cipher text "WGVXFCVO". Select all the shift ciphers that could have been used to encrypt the phrase. f(p) = (p+21) mod 26 f(p) = (p-5) mod 26 |f(p) = (p+19) mod 26 |f(p) = (p-31) mod 26 Question 2 ( ✔) Listen ► Select all the keys (a, b) that make the affine transformation f(p) = (ap + b) mod 26 valid. (1,26) (7,-5) [(13,9) (50, 3) Question 3 ( ✔Listen Encrypt the message "REDS HACKED BLUES" using the block cipher defined by • σ(1) = 3 • σ(2) = 5 • σ(3) = 1 • σ(4)=7 • σ(5)=2 • σ(6) = 4 • σ(7) = 6 Type your answer using UPPERCASE, and omit spaces. Question 4 (2 ◄ Listen ▶ A/ True or False: "The receiver of a message encrypted with RSA key (n = p*q, e) knows what the integers p and q are." True False Question 5 (2 Listen ► Which of the following is the decryption function for the RSA key (8633, 13)? HINT: 8633 = 97*89 3317 f-¹(c) = c³3¹7 mod 8624 f¹(c) = c3317 mod 8633 f¹(c) c¹3 mod 8633 = f¹(c)=c³217 mod 8624
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Encryption and decryption
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education