Q2/ This problem provide a numerical example of encryption using a one-round version of DES. We start with the same bit pattern for the key K and the plaintext, namely: Hexadecimal notation: 0 1 2 3 4 56789ABCDEF 8 12.16 20. 24 28 32 Binary notation: 0000 0001 0010 0011 0100 0101 0110 0111 by 48 52 56 6. 36 ५० 1000 1001 1010 1011 1100 1101 1110 1111 $ جاگا a. Derive K1, the first-round subkey. b. Derive, .LO, RO c. Expand to R0 to get E(RC), where is the expansion function. d. Calculate A=E(RO) KUR KI

Encryption is commonly used to disguise messages on the internet. A Caesar cipher performs a shift of all of the characters in a string (based on their ASCII values, see Table 2.1), e.g. h e l l o → m j q q tThe example shows a shift with a distance of 5characters, i.e. h(ASCII:104) → m(ASCII:109)Write a C/C++ program that asks the user to input a line of plaintext and the distance value and outputs an encrypted text using a Caesar cipher, with the ASCII values range from 0 through 127. Use underscores (ASCII: 95) to represent space characters.Underscore characters should not be encrypted, and any character that is encrypted may not become an underscore. In this case, the character should be changed to the next character in the ASCII table.The program should work for any printable characters.NB: No strings (datatype) or library functions may be used.See Figure 2.1 for example output.

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;}

Use symmetric ciphers to encrypt message "“promise" and decrypt message "FOG". The representation of characters in modulo 26 is described as follows: Plaintext - a bcdefg|hijk1 mnopar stuvwx y z Ciphertext A BCD|EFG|HIJKL|M|NO|P|Q|R s T|U|VwxY|Z Value 00 01 02|03 04 05 06|07|08|09|10|11 12|13|14|15 16|17 18|19 20 21 22 23 24 25 The mathematical equations for encryption and decryption can be described as follows: Encryption Ea:i→i+kmod 26 Decryption Da : i→i-k mod 26 i represents the messages (plaintext or cipher), k represents a symmetric key. In this case k=20

Encrypt a specific message (see below) using RSA with your encryption key: Let M be the numerical portion of your B-number, minus leading zeroes (for example, B00123456 has numerical portion 123456), plus the constant 3100. 3100 is 515377520732011331036461129765621272702107522001. 1. Compute C=Me (mod n); 2. Compute the “signature” S = Md (mod n) Provide the values C and S. B-number is B00123456

Plz don't use chat gpt

Encrypt the animal name marmot using the letter to number correspondence abc de f 8hijk 1 mnopar stuvw x y 2 e 1 2 3 4 5 6 7 8 9 18 11 12 13 14 15 16 17 18 19 28 21 22 23 24 25 and the encryption function e :n + (n +1) mod 26 The answer will be a nonsense word (no numbers).

Encrypt the 12-bit plaintext 101010100111 using Simplified B-DES and the 9-bit key K = 010001111. This is a non-computer problem and you need to show all the steps of the encryption process

LODS

Suppose you are told that the one time pad encryption of the message "attack at dawn" is "09elc5f70a65ac519458e7e53f36" (the plaintext letters are encoded as 8-bit ASCII and the given ciphertext is written in hex). What would be the one time pad encryption of the message “attack at dusk" under the same OTP key? Note: The 8-bit ASCII value of a is 01100001 or 97.