1)Use the Euclidean algorithm to evaluate gcd (2093, 836).

2)A more general class of encryption function is provided by an affine cipher.

: , () ( + ) , = {1,2, , 1}, where the secret key a and b are integers and gcd(a,n)=1. The corresponding decryption function is

^-1: , ^-1 () ( ) ,

where c is an integer chosen so that 1 .

Find the decryption key for the affine cipher with n=26, a=11 and b=8. Encrypt the message with cord 5, 10 and 16.

please don't write the answer on paper