Let M be the plaintext message M = MALAYSIA and the private key, K||ISSOGOODa) Represent your plaintext binary number as a form of a block, using the DESencryption technique (2 equal blocks).b) Using the initial permutation (table is provided below), please provide yourplaintext output.Initial PermutationInitial Permutation58 50 42 34 26 18 10 0260 52 44 36 28 20 12 0462 54 46 38 30 22 14 0664 56 48 40 32 24 16 0857 49 41 33 25 17 09 0159 51 43 35 27 19 11 0361 53 45 37 29 21 13 0563 55 47 39 31 23 15 07

Actually, given question regarding DES encryption technique.

Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD a) Represent your plaintext binary number as a form of a block, using the DES encryption technique (2 equal blocks). b) Using the initial permutation (table is provided below), please provide you plaintext output. Initial Permutation Initial Permutation 58 50 42 34 26 18 10 02 60 52 44 36 28 20 12 04 62 54 46 38 30 22 14 06 64 56 48 40 32 24 16 08 57 49 41 33 25 17 09 01 59 51 43 35 27 19 11 03 61 53 45 37 29 21 13 05

Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD a) Represent your plaintext binary number as a form of a block, using the DES encryption technique (2 equal blocks). b) Using the initial permutation (table is provided below), please provide you plaintext output. Initial Permutation Initial Permutation 58 50 42 34 26 18 10 02 60 52 44 36 28 20 12 04 62 54 46 38 30 22 14 06 64 56 48 40 32 24 16 08 57 49 41 33 25 17 09 01 59 51 43 35 27 19 11 03 61 53 45 37 29 21 13 05

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

Using C programming language: A Transposition Cipher A very simple transposition cipher encrypt(S, N) can be described by the following rules: If the length of S is 1 or 2, then encrypt(S, N) is S. If S is a string of N characters s1 s2 s3... sN and k = N/2, then encrypt(S)= encrypt(sk sk−1... s2 s1 ,K)+ encrypt(sN sN−1... sk+1 ,N - K) where + indicates string concatenation. For example, encrypt("Ok", 2) = "Ok" and encrypt("12345678", 8) = "34127856". Write a program to implement this cipher. The input is a file that is guaranteed to have less then 2048 characters. Code structure might look like this: #define MAX_SIZE 2048char text_buffer[MAX_SIZE];int main(){ // read file into text_buffer encrypt(text_buffer, n); // print out text_buffer return 0;}
Please write the code in python. CountRepetitions that takes a ciphertext as an argument and returns the total number of repetitions between all 16-byte blocks
Write a python code that implements the RSA encryption and decryption. Using the created code encrypt and decrypt the following message “I encrypted this message using RSA” using P1=53, P2=59, e=3 Use letter indices for the encryption
1. (A=0,Z=25) Encode: BE HONEST using the encrypting function f (p) = (p+ 3) mod 26. 2. Decode: GPWJO if the original message was encrypted using f (p) = (7p+ 10) mod 26. 3. What is the 6th term in the following sequence? 11, 15, 19, 23, ___, Blank 1 4. Using the Euclidean algorithm to compute for the gcd (1283, 7295), what is the value of the last nonzero remainder? 5. Is the given integer 9321 a prime or composite?
1. We have defined a symmetric cryptography algorithm using the XOR operator. Assume our messages (before encryption) consist of only uppercase and lowercase letters, digits and blank character. In addition, assume the key size is only one byte which is an integer between 0 and 255 (inclusive). The pseudocode of the proposed encryption algorithm is as follows: Read the message // for example message=”Hi” Read the key // for example key=10 Cipher_text=[] //an empty list for i=1 to len(message): Cipher_text= Cipher_text.append(XOR(message[i],key)) Return Cipher_text Assume XOR function, takes a character and the key, then returns the result of bitwise XOR of ASCII code of the letter with the key as an (one byte) integer. For example, if message=”Hi” and key=10, then we should first calculate the ASCCI code of “H” which is 72 and find the result of (72 XOR 10) which is 66. Then the ASCCI code of “i” is 105, so the result of (105 XOR 10) is 99. Thus the Cipher_text would be…
1. We have defined a symmetric cryptography algorithm using the XOR operator. Assume our messages (before encryption) consist of only uppercase and lowercase letters, digits and blank character. In addition, assume the key size is only one byte which is an integer between 0 and 255 (inclusive). The pseudocode of the proposed encryption algorithm is as follows: Read the message // for example message=”Hi” Read the key // for example key=10 Cipher_text=[] //an empty list for i=1 to len(message): Cipher_text= Cipher_text.append(XOR(message[i],key)) Return Cipher_text Assume XOR function, takes a character and the key, then returns the result of bitwise XOR of ASCII code of the letter with the key as an (one byte) integer. For example, if message=”Hi” and key=10, then we should first calculate the ASCCI code of “H” which is 72 and find the result of (72 XOR 10) which is 66. Then the ASCCI code of “i” is 105, so the result of (105 XOR 10) is 99. Thus the Cipher_text would be…
Encrypt the message " MATH " by translating the letters into numbersand then applying the encryption function given, and then translating the numbers back into letters.(a) f(p)=(17p+5) mod 26 _____ (b) f(p)=(15p+14) mod 26 ___ (c) f(p)=(19p+5) mod 26 ___Use 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,O=14,P=15,Q=16,R=17, S=18,T=19,U=20,V=21,W=22,X=23,Y=24,Z=25
Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).
The parity function is a very simple hash function producing a one-bit digest, which is 0 if the number of bits in the message is even and 1 if it is odd. Consider a communication system that uses 7 bits out of every byte to transmit data, and reserves the 8th bit (the one on the right) to transmit the parity of the other seven bits, for purposes of error checking. Below is the binary representation of some bytes that were transmitted using this system. For each one, tell whether there is a reason to suspect an error in transmission, giving the reason for your answer. 10110011 11101111 10101100 00110011
In a special case of a permutation cipher, we take a message, M, and write its letters in an s× t table, in a row-major fashion, and then let the ciphertext be a column-major listing of the entries in the table. For example, to encrypt the message ATTACKATDAWN, using a 3 × 4 table, we would write the message as ATTA CKAT DAWN and then write down the ciphertext as ACDTKATAWATN. The secret key in this cryptosystem is the pair (s, t). How is decryption done in this cryptosystem? Also, how hard would it be to attack this cryptosystem using a ciphertext-only attack?
The following message uses a direct mapping of letters to numbers (i.e. A-1, B=2, c-3, etc.).Using the values D=17 and m=21, decrypt the following message:10 15 12 18 1 3 17 14 7 18 14 17 17 9 18 14
The Lingala Language of Republic of Congo has 35 letters. Consider an Affine cipher, which encrypts each letter according to the rule: C=(p×k1+k2) mod 35. Here C, p, k1, and k2 are each members in the range 0 to 34, where C represents the ciphertext letter, p the plaintext letter, and k1 and k2 are constant keys. How many possible keys does this affine system have? Explain in details.