Using the simplified RC4 Algorithm of 8 bytes (rather than the full 256 bytes), find the final Keystream and Cipherpext of the following Input string:   S-Array of length 8, [S0 S1 S2 S3 S4 S5 S6 S7] = [7 6 5 4 3 2 1 0] Key, K = [3 1 4 1 5] Plaintext, PT = [6 1 5 4]   Hint: For the simplified stream generation, you can use this pseudocode (only up to the PT length):                         /* Initialization */ set i and j = 0                 for i = i + 1 to length of PT                        j = j + S[i] mod 8                        swap S[i], S[j]                            t = S[i] + S[j] mod 8

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…

use python please

21. RSA problem: given plaintext P, e, prime numbers p, q, compute ciphertext C. Decrypt C and verify you get plaintext P back.

A bit shift is a procedure whereby the bits in a bit string are moved to the left or to the right. For example, we can shift the bits in the string 1011 two places to the left to produce the string 1110. Note that the leftmost two bits are wrapped around to the right side of the string in this operation. Define two scripts, shiftLeft.py and shiftRight.py, that expect a bit string as an input. • The script shiftLeft shifts the bits in its input one place to the left, wrapping the leftmost bit to the rightmost position. • The script shiftRight performs the inverse operation. • Each script prints the resulting string. An example of shiftLeft.py input and output is shown below: Enter a string of bits: Hello world! ello world!H An example of shiftRight,py input and output is shown below: Enter a string of bits: Hello world! !Hello world

(a) Write a complete PHP code that would produce the output below: 1 12 123 1234 12345 123456 1234567 12345678 123456789 (b) Differentiate between "sha1" and "md5" encryption function of MySQL clearly giving examples of each. (c) Give the major difference between the POST and the GET method.

This question concerns block cipher modes. We will use a simple affine cipher, which can be expressed in C as follows. char cipher(unsigned char block, char key) { return (key+11*block)%256; } Note that the block size is 8 bits, which is one byte (and one ASCII character). We will work with the fixed key 0x08. We now encrypt various plaintexts using modes for this cipher. In every case in which the mode requires an IV, the IV will be OXAA. In the case of CTR mode, we use a (nonce || counter) arrangement in which the nonce is the left 5 bits of OXAA and the counter is a 3 bit counter that begins at 0. In all of the problems given below, one character is one block. Each character of the plaintext should be regarded as its corresponding ASCII code. a) Encrypt the plaintext "spider" using CTR mode. Please enter your answer in hex. (Please do **not** enter an 0x, as this has been done.) Ox b) Encrypt the plaintext "spelling" using ECB mode. Please enter your answer in hex. Ox c) Encrypt the…

This question concerns block cipher modes. We will use a simple affine cipher, which can be expressed in C as follows. char cipher(unsigned char block, char key) { return (key+11*block)%256; } Note that the block size is 8 bits, which is one byte (and one ASCII character). We will work with the fixed key 0x08. We now encrypt various plaintexts using modes for this cipher. In every case in which the mode requires an IV, the IV will be OxAA. In the case of CTR mode, we use a (nonce || counter) arrangement in which the nonce is the left 5 bits of OxAA and the counter is a 3 bit counter that begins at 0. In all of the problems given below, one character is one block. Each character of the plaintext should be regarded as its corresponding ASCII code. a) Encrypt the plaintext "lippo" using CTR mode. Please enter your answer in hex. (Please do **not** enter an Ox, as this has been done.) Ox b) Encrypt the plaintext "lippi" using ECB mode. Please enter your answer in hex. Ox c) Encrypt the…

AO A B C D E F G H I J K L M 0 1 2 3 4 5 6 7 8 9 10 11 12 N 0 P Q R S T U V W X Y Z 13 14 15 16 17 18 19 20 21 22 23 24 25 (Show your work.) Encrypt the message "TYVQ" using Affine Cipher in English alphabet with a = 7; b =22 and encryption function is f(p) = (7p+22) mod 26 A) hens B) helo C) zine D) zict

The ROT-13 algorithm encrypts a string one character at a time by adding 13 to the value of the internal representation of the character. We want our encryption scheme to cover the entire printable ASCII range. After examining the ASCII character set and their internal representations, we see that characters 0 through 32 and character 127 are control characters. Technically, characters 32 (space) and 127 (DEL) are printable, but we don’t want to include them in our encryption routine. Therefore, we want our encrypted string to only contain characters in the range of 33 through 126. As an example:   Plaintext:              Norwich Ciphertext:                        [|!&vpu   The internal representation of ‘N’ is 78. 78 plus 13 is 91, which is the character ‘[‘. The internal representation of ‘o’ is 111. 111 plus 13 is 124, which is the character ‘|’. The internal representation of ‘r’ is 114. 114 plus 13 is 127. Since 126 is our maximum value for our desired printable range, we…