**This is an old revision of the document!**

# Homework Assignment #4

## Objective

To solve an RSA encryption problem. Also to determine asymptotic bounds on running time using the Master Theorem.

## Exercises

### Question 1

Problem 1.27 in the textbook.

Use the Extended Euclid algorithm to find the secret key $d$. Be sure to decrypt your message also to verify that everything is working.

### Question 2

In the textbook 2.1 (down to two-bit numbers; i.e., threshhold = 2)

### Questions 3-7

Exercises 2.5(a-e) in the textbook: find asymptotic bounds using only the Master Theorem – Big-O is sufficient.