h7 - [50] Homework 7: Basic Number Theory [10] Use the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: [50] Homework 7: Basic Number Theory [10] Use the Euclidean algorithm to find (a) gcd(1529, 14039), (b) gcd(1111, 11111). [10] Compute 61531 mod 713. [10] Prove that 937 is an inverse of 13 modulo 2436. [10] Solve 4x = 5 mod 9. [10] Encrypt the message ATTACK using the RSA system with n = 43 59 and e = 13, translating each letter into integers (where A = 00, B = 01, . . . Z = 25) and grouping pairs of integers, as we did in class. ...
View Full Document

This homework help was uploaded on 04/19/2008 for the course CS 182 taught by Professor W.szpankowski during the Fall '08 term at Purdue University-West Lafayette.

Ask a homework question - tutors are online