a)
Given Information:
Each block cipher Tireverses the order of the eight input bits. The 64-bit scrambler does not modify any bits and hence the output value of the mth bit is equal to the input value of the mth bit.
Example:
“11110000” becomes “00001111”.
Block Cipher:
A Block Cipher is a method of encrypting text in which a cryptographic key and
b)
Given Information:
Each block cipher Tireverses the order of the eight input bits. The 64-bit scrambler does not modify any bits and hence the output value of the mth bit is equal to the input value of the mth bit.
Example:
“11110000” becomes “00001111”.
Block Cipher:
A Block Cipher is a method of encrypting text in which a cryptographic key and algorithm are applied to blocks of data.
c)
Given Information:
Each block cipher Tireverses the order of the eight input bits. The 64-bit scrambler does not modify any bits and hence the output value of the mth bit is equal to the input value of the mth bit.
Example:
“11110000” becomes “00001111”.
Block Cipher:
A Block Cipher is a method of encrypting text in which a cryptographic key and algorithm are applied to blocks of data.
Want to see the full answer?
Check out a sample textbook solutionChapter 8 Solutions
EBK COMPUTER NETWORKING
- What is the correct value of SHA-512 message-length filed if the message length is: a) 3967 b) 3968arrow_forward6. Consider the following simplified version of the CFB mode. The plaintext is broken into 32-bit pieces: P = [P₁, P2, ,], where each P, has 32 bits, rather than the 8 bits used in CFB. Encryption proceeds as follows. An initial 64-bit X₁ is chosen. Then for j = 1,2,..., the following is performed: CjPjL32 (Ek (Xj)) Xj+1 = R32(X₁)||C₁ where L32(X) denotes the 32 leftmost bits of X, R32 (X) denotes the rightmost 32 bits of X, and XY denotes the string obtained by writing X followed by Y. Find the decryption algorithm.arrow_forwarda. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa).arrow_forward
- To prevent the tapping and use of information on a wireless network which has brought untold mistrust amongst the directors of Okonko Systems, you suggested that every message that is transmitted should go through the following: A systematic two left bit shift; After “a” above, the algorithm f[(6m +2) + k] mode 13 should be applied to the cipher text, where m is the message and k =9 is a key; After “b” above, perform a systematic right bit shift to the new cipher; The message should then be transmitted. If on a trial basis, the message is “genomics” Use the mono – alphabetic letters where a = 0, b = 1, ….z = 25 to find the cipher that would be transmittedarrow_forwardNote: The notation from this problem is from Understanding Cryptography by Paar and Pelzi. Suppose you have an LFSR with 6 state bits. The first 12 bits of output produced by this LFSR are 111011100001 = 80818283848586878889810811- The first bit produced is the leftmost bit and the bit most recently produced is the rightmost bit. a) What is the initial state of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent 85= 0,84 = 1,83 = 0, 82=1,81 = 0, 80 = 1). b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent ps = 0, P₁1, P30, P₂=1, P₁ = 0, Po = 1).arrow_forwardSuppose Data Encryption Standard (DES) is used to encrypt the following 64-bit block of plaintext: 6 3 F A C 0 D 0 3 4 D 9 F 7 9 3 Given the initial 64-bit key is: 1 C 5 8 7 F 1 C 1 3 9 2 4 F E F Expand R0 to get E[R0]arrow_forward
- Consider a 64 bit Block Encryption algorithm E. Suppose you have encrypted a 64 byte message Mı, M2, .. M64. Show / explain using diagrammatic forms how you would decrypt the message using CBC and OFB-16. Use an 8 byte IV: I1, I2, ... Is.arrow_forwardDo not copy other's work. Show your ownarrow_forwardpadding Question 11 Suppose we have a block cipher with block size 8-bytes (64-bits) and we will use the padding scheme described in class and used in the homework (PKCS #7, RFC 5652). How many bytes (octets) are added to a message consisting of 11 bytes when applying the padding scheme in PKCS7? Note: The message is written in hexadecimal. Each pair of digits (number or letter) is ONE byte (octet). You answer must be a number (for example, 3, 5, 9, etc.).arrow_forward
- Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situationarrow_forwardYou have an originating plain text message (in hexadecimal): 41 72 61 62 Use your Student ID number to obtain a 10-bit key as follows: Key (in decimal) = (ID mod 1024) +1.You have to manually cipher the first block of the following plain text message (first 8 bits). The encrypting process will be done using Simplified DES (S-DES). you must explain all steps in details [mandatory: write down all the calculations].arrow_forwardConsider PKCS-2.1 with n = 512 bit and SHA-1. Assuming L and PS is empty string, then describe in step-by-step that in one go maximum bytes of data can be encrypted. Now, if the modulus n is increased from 512 bit to 2048 bit then approximately how slow/fast will be the encryption, if maximum allowed bytes are encrypted.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education