Task 1: Explain how prime numbers are important by evaluating an example based on the RSA algorithm. A) Generate a public/private key pair: Assuming the two primes chosen to generate the keys as the following p=13 q=the nearest prime number to your last two digits of your university ID You should choose a value e > 5. Encrypt a message M=12 then decrypt the ciphertext to retrieve the original message. B) Repeat your work in A and B without using prime numbers to generate the keys and compare your results. You should show all your calculations and assumptions.

Given the plaintext “I LOVE CRYPTO”, what is the ciphertext given that: Row Transposition Cipher algorithm with the key is 3214.

Suppose you intercepted the following encrypted message: 20 5 21 3 49 4 49 3 4 15 You also know the encryption key is d=7 and it was determined using n=55. Decrypt this message. Assume that letters 'A' through 'Z' were initially coded using 1 through 26 and a blank was initially coded using 27.  no hand wriiten

1. Asymmetric Encryption and Message Authentication:      a) The primitive root of a prime number is the basic principle of Diffie-Hellman.         i) Is 3 the primitive root of 11? Show the proof with your calculation.        ii) What are the important criteria for selecting a prime number in cryptography? Is 11 a good choice for such a purpose?    b) Find the parameters stated using the Diffie-Hellman methods, given the user A and B shared a prime number and its primitive root of 23 and 5, respectively.         i) If user A public key value is 8, find the A’s private key.        ii) If user B public key value is 19, what is the common secret key?   c) In the following scenario, we will compare the security services that are given by digital signatures (DS) and message authentication codes (MAC). We assume that James can read all messages send from Chan to Badrul and the other way around, too. James has no knowledge of any keys but the public one in the case of DS. State whether and…