Is it possible that two different plaintexts can give the same ciphertexts using Hill Cipher? Support your answer with an example.

Let E'(T,X) be a tweakable block cipher that has already been keyed. Given plaintext P = P1 || P2 || ... || Pn (ie, P is an n-block plaintext). Ci = E'(i, Pi) for i=1..nsum = P1 xor P2 xor ... xor Pntag = E'(0,sum) For simplicity let's say that E'(T,X) = ROTL(X,T+1)  (ie, X rotated left T+1 bits. If the block cipher block size is 8 bits and you are encrypting the two byte plaintext 67 89, what ciphertext and tag would be created? Fill in each box as a two-digit hex value. C1____? C2____? tag____?

Use the RSA cipher with public key n = 713 = 23 · 31 and e = 43 to decrypt the ciphertext 675 089 089 048 and find the original messages. Consider d=307 and Performs all steps show all the step on how you solved it use pencil and paper. dont use AI