1. Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD a) Using the appropriate steps of DES operation, what is the final output of the key for round 1 (hint: you have to use the circular left shift and permutation compression (PC) table provided below). Key Permutation-Compression Table 14 17 11 24 01 05 03 28 15 06 21 10 23 19 12 04 26 08 16 07 27 20 13 02 41 52 31 37 47 55 30 40 51 45 33 48 44 49 39 56 34 53 46 42 50 36 29 32 b) For round 1, please provide your output for the XOR operation of plaintext and the key, according to the DES operation.

1. Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD a) Using the appropriate steps of DES operation, what is the final output of the key for round 1 (hint: you have to use the circular left shift and permutation compression (PC) table provided below). Key Permutation-Compression Table 14 17 11 24 01 05 03 28 15 06 21 10 23 19 12 04 26 08 16 07 27 20 13 02 41 52 31 37 47 55 30 40 51 45 33 48 44 49 39 56 34 53 46 42 50 36 29 32 b) For round 1, please provide your output for the XOR operation of plaintext and the key, according to the DES operation.

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

See similar textbooks

Similar questions

Consider the binary BCH code with length 127 and expected distance 6 using the binary field extension F 128 with size 128. What is the length of the code, and can you guarantee a minimum distance?
Create a Huffman compression code for the phrase “Expecto Patronum” (ignoring character case). You answer should include your Huffman code tree (including clear illustration of it’s development) plus the resultant encoded phrase.
want genuine and correct answer dont copy from existing
1. Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD, Supposed we using the appropriate steps of DES operation and the permutation compression (PC) table provided below get he final output of the key for round 1. a) Based on the output above, explain the next process using the S-box table, and show the output from this operation. b) Based on the output above, explain the next process using a straight permutation table, and show the output from this operation.
write an encoder and a decoder for a modified "book cipher." A book cipher uses a document or book as the cipher key, and the cipher itself uses numbers that reference the words within the text. For example, one of the Beale ciphers used an edition of The Declaration of Independence as the cipher key. The cipher you will write will use a pair of numbers corresponding to each letter in the text. The first number denotes the position of a word in the key text (starting at 0), and the second number denotes the position of the letter in the word (also starting at 0). For instance, given the following key text (the numbers correspond to the index of the first word in the line) [0] 'Twas brillig, and the slithy toves Did gyre and gimble in the wabe; [13] All mimsy were the borogoves, And the mome raths outgrabe. [23] "Beware the Jabberwock, my son! The jaws that bite, the claws that catch! [36] Beware the Jubjub bird, and shun The frumious Bandersnatch!" [45] He took his vorpal sword in…
in ASM (Irvine 32) write a code that solves R = (A % B) % (C % D). Note that ABC are 8 bit signed integers and % is the operator modulo which holds the division operation remainder.
Can you solve the question step by step ?
Do
Please answer ASAP
ITDR2102: Computer Organization – T Tutorial 2 From Lecture 2 (Data Representatic 1. Using 8-bits, convert -45 to excess-127 notation in binary.
Hasan is new to algorithm; you are assigned to help him in finding out how many characters comparison will Horspool's Algorithm will require in searching for pattern '11111'in a given binary text file of 1000 zeros.
Let's consider two files named File1 and File2. Inside these files, there are only four symbols, the symbols A, C, G and T, mixed and repetitive. We know how many times each of these symbols occurs. We want to use Huffman encoding to compress these files. a) Huffman encoding fails to do any compression for File1. In this case, what would be the frequency of occurrence of symbols A, C, G and T in File1? (You can give any frequency distribution that results in zero compression.) In the example you gave, apply Huffman coding and show that there is no compression at all. b) Is it possible to compress more than 50% with Huffman encoding for a file containing only 4 different symbols? Why? Briefly explain your answer.