Suppose that we have the following 128-bit AES key, given in hexadecimal representation: 54 77 6F 20 4F 6E 65 20 4E 69 6E 65 20 54 77 6F  Construct the round key for the first round.

Example: Assuming m-7 bits and using three of those bits for representing the fractional part, ( 1100.000 )2 ( 0110.000 )2 ( 0011.000 )2 ( 0001.100 )2 ( 0000.110 )2 ( 0000.011 )2 (12)10 %3D (12)10 / 2 (6)10 (6)10 /2 (3)10 (3)10 /2 (1.5)10 (1.5)10 / 2 (0.75)10 (0.75)10 / 2 (0.375)10 In this case, each successive division by two has shifted the binary sequence to the right by one bit.

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.

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

Use C++ coding language and provide a code that works properly  input.txt 4 51 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 05 71 0 1 0 0 1 11 0 1 1 1 1 11 1 1 1 1 0 11 0 1 1 1 0 11 0 1 0 1 0 10

Simplify the following expression, 3 (-8 x –6 × 3) |4 – 12| – (6 – 4)*] 1156 3444 1148 -3468 348