please assist with crytography

CYB 710 Module 4: Homework1. Use the method of repeated squaring to find the least residue of 7945modulo 811, showing all steps as illustrated in our Module 4 lecturenotes.2. Use the Euclidean Algorithm to find the following gcd, and thenuse the Extended Euclidean Algorithm to write this gcd in the form(a, b) = ma nb. Show all steps (long divisions, substitutions, etc.) asin our lecture notes.(1203, 8691)3. (a) Encrypt 139 using an RSA cryptosystem with n = 3277 ande = 17 (use the method of repeated squaring, showing all steps).(b) Find the decrypting power d using the method outlined in thelast example in our Module 4 lecture notes, showing all steps (e.g. usethe Extended Euclidean Algorithm rather than brute force).

I canonly give what i offered as the bid however if you message me how much you want to be paid i can cover it no later than tuesday. There are about3 more assignments like this that I will be willing to pay for as well.