EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 8, Problem R8RQ
Explanation of Solution
Given message: “10101111”
If one needs to encrypt the given message by encrypting the decimal number that corresponds to the message.
The Decimal number corresponds to the above message is:
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
You may use a software to do calculations but you have to write down the details.
The correspondence of letters table:
A
01
B C D E F GH I J K L M
02 03 04 05 06 07 08 09 10 11 12 13
TU V W X Y
N O P Q R
14 15 16 17 18
Z space
S
19 20 21 22 23 24 25 26 00
4. Decipher the message "NUMBER", which was enciphered using the blocked
cipher that sends the plaintext block (x₁, x2) into the ciphertext block (y₁, y2) with
2
(22) = (₂¹9) (2)
mod 27.
Q7: Using the same notations as in the lecture, e.g., p and q are the two primes
and e and d are the public key and private key, respectively, p = 5, q = 13 and e=
5. Using the phi(n) that you found in question 6 and the Extended Euclidean
algorithm yields d = 29. What is the cipher text C when encrypting M = 17?
Write a Java program to encrypt and decrypt a phrase using two similar approaches, each insecure by
modern standards.
The first approach is called the Caesar Cipher, and is a simple "substitution cipher" where characters in a
message are replaced by a substitute character.
The second approach, due to Giovan Battista Bellaso (b 1505, d 1581), uses a key word, where each
character in the word specifies the offset for the corresponding character in the message, with the key
word wrapping around as needed.
Chapter 8 Solutions
EBK COMPUTER NETWORKING
Ch. 8 - Prob. R1RQCh. 8 - Prob. R2RQCh. 8 - Prob. R3RQCh. 8 - Prob. R4RQCh. 8 - Prob. R5RQCh. 8 - Prob. R6RQCh. 8 - Prob. R7RQCh. 8 - Prob. R8RQCh. 8 - Prob. R9RQCh. 8 - Prob. R10RQ
Ch. 8 - Prob. R11RQCh. 8 - Prob. R12RQCh. 8 - Prob. R13RQCh. 8 - Prob. R14RQCh. 8 - Prob. R15RQCh. 8 - Prob. R16RQCh. 8 - Prob. R17RQCh. 8 - Prob. R18RQCh. 8 - Prob. R19RQCh. 8 - Prob. R20RQCh. 8 - Prob. R21RQCh. 8 - Prob. R22RQCh. 8 - Prob. R23RQCh. 8 - Prob. R24RQCh. 8 - Prob. R25RQCh. 8 - Prob. R26RQCh. 8 - Prob. R27RQCh. 8 - Prob. R28RQCh. 8 - Prob. R29RQCh. 8 - Prob. R30RQCh. 8 - Prob. R31RQCh. 8 - Prob. R32RQCh. 8 - Prob. R33RQCh. 8 - Prob. P1PCh. 8 - Prob. P2PCh. 8 - Prob. P3PCh. 8 - Prob. P4PCh. 8 - Prob. P5PCh. 8 - Prob. P6PCh. 8 - Prob. P8PCh. 8 - Prob. P12PCh. 8 - Prob. P13PCh. 8 - Prob. P14PCh. 8 - Prob. P18PCh. 8 - Prob. P20PCh. 8 - Prob. P21PCh. 8 - Prob. P22PCh. 8 - Prob. P23P
Knowledge Booster
Similar questions
- Write a java program to encrypt your name and your friend name by using caser cipher with key input from you. Also, print out the names in encrypt and decrypt formatarrow_forwardEncrypt The following correspondence between letters and numbers is used in the Caesar cypher. a b d e f i k lm n o r u V W X y z 1 2 3 4 6 7 8 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Encrypt the animal name zebra with the Caesar cypher with a key of 25. What is the encrypted animal name (enter a string of letters with no spaces)? Save Submit You have used 0 of 1 attempt Decrypt An animal name was encrypted with the scheme described above. The encrypted animal name is azmchbnns . What is the animal name? Savearrow_forwardEncrypt The following correspondence between letters and numbers is used in the Caesar cypher. a b c d f h i j k lm n t V W e g 6. u y 0 1 2 3 4 7 8. 9. 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Encrypt the animal name zebra with the Caesar cypher with a key of 3. What is the encrypted animal name (enter a string of letters with no spaces)? Decrypt An animal name was encrypted with the scheme described in the previous question (it was encoded with the key 3). The encrypted animal name is pduprw .What is the animal name?arrow_forward
- Encrypt the message SEE YOU IN THE PARK AFTER CLASS using a transposition cipher with key word HONEY. Use 5 characters per row.arrow_forwardEncrypt the message "HALT" by translating the letters into numbers (via A = 0, B = 1, C = 2, D = 3, E = 4, F = 5, G = 6, H = 7, I = 8, J = 9, K = 10, L = 11, M = 12, N = 13,0 = 14, P = 15, Q = 16, R = 17, S = 18, T = 19, U = 20, V = 21, W = 22, X = 23, Y = 24, Z = 25 ) and then applying the encryption function given, and then translating the numbers back into letters. (a) f(p) = (p+5) mod 26 (b) f(p) = (p+6) mod 26 (c) f(p) = (p+6) mod 26arrow_forwardThe ciphertext below was encrypted using a substitution cipher. In your favorite language (in C++ or Python) decrypt the ciphertext without knowledge of the key using frequency analysis lrvmnir bpr sumvbwvr jx bpr lmiwv yjeryrkbi jx qmbm wi bpr xjvni mkd ymibrut jx irhx wi bpr riirkvr jx ymbinlmtmipw utn qmumbr dj w ipmhh but bj rhnvwdmbr bpr yjeryrkbi jx bpr qmbm mvvjudwko bj yt wkbrusurbmbwjk lmird jk xjubt trmui jx ibndt wb wi kjb mk rmit bmiq bj rashmwk rmvp yjeryrkb mkd wbi iwokwxwvmkvr mkd ijyr ynib urymwk nkrashmwkrd bj ower m vjyshrbr rashmkmbwjk jkr cjnhd pmer bj lr fnmhwxwrd mkd wkiswurd bj invp mk rabrkb bpmb pr vjnhd urmvp bpr ibmbr jx rkhwopbrkrd ywkd vmsmlhr jx urvjokwgwko ijnkdhrii ijnkd mkd ipmsrhrii ipmsr w dj kjb drry ytirhx bpr xwkmh mnbpjuwbt lnb yt rasruwrkvr cwbp qmbm pmi hrxb kj djnlb bpmb bpr xjhhjcwko wi bpr sujsru msshwvmbwjk mkd wkbrusurbmbwjk w jxxru yt bprjuwri wk bpr pjsr bpmb bpr riirkvr jx jqwkmcmk qmumbr cwhh urymwk wkbmvb a) Frequency analysis:…arrow_forward
- Random J. Programmer discovers a much faster method of generating a 64-bits signature for a message using secret key technology. The idea is to simply encrypt the first 64 bits of the message, and use that as the signature. What’s wrong with this idea?arrow_forwardWrite a program (in JAVA) that gives the user options to encrypt and decrypt with DES and AES. The program should further offer the user to select a block mode from the options: ECB, CBC, OFB, CFB, and CTR. Your program should be able to work with any length of plaintext message.arrow_forwardAlice's RSA public key is P = (e,n) = (5,901). Bob sends Alice the message by encoding it as follows. First he assigns numbers to characters: A is 3, B is 4, ..., Z is 28, a blank is 29, quotation marks: 30, a period: 31, a coma: 32, an apostrophe: 33. Then he uses RSA to encode each number separately. Bob's encoded message is: 030 673 332 785 171 589 782 171 828 589 785 568 782 785 713 782 813 785 123 589 828 673 589 487 589 785 813 890 243 813 785 733 243 813 890 589 733 243 813 673 422 769 785 673 769 785 769 673 733 171 828 589 291 785 673 813 785 673 769 785 782 713 828 482 785 123 589 422 243 500 769 589 785 813 890 589 482 785 568 782 785 713 782 813 785 549 589 243 828 673 367 589 785 890 782 587 785 422 782 733 171 828 673 422 243 813 589 568 785 828 673 332 589 785 673 769 777 030 Decode Bob's message. Notice that you don't have Bob's secret key, so you need to "break" RSA to decrypt his message. For the solution, you need to provide the following: (a) Describe step by step…arrow_forward
- Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.arrow_forwardE x e r c i s e • 1 : Apply frequency test to verify the randomness of the output of the following text: 1. The following plaintext: In cryptography, a transposition cipher (also known as a permutation cipher) is a method of encryption which scrambles the positions of characters (transposition) without changing the characters themselves. Transposition ciphers reorder units of plaintext (typically characters or groups of characters) according to a regular system to produce a ciphertext which is a permutation of the plaintext. They differ from substitution ciphers, which do not change the position of units of plaintext but instead change the units themselves. Despite the difference between transposition and substitution operations, they are often combined, as in historical ciphers like the ADFGVX cipher or complex high-quality encryption methods like the modern Advanced Encryption Standard (AES). laintexts can be rearranged into a ciphertext using a key, scrambling the order of…arrow_forwardwrite a program in python as implementation of decryption of affine cipher. output should be:encrypted message is:....decrypted message is:..... plaint text: cryptologya coefficient: 3b coefficient: 1arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education