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

Homework Assignment #4


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


Show all work. i.e., justify your answers.

Question 1

Problem 1.27 in the textbook.

Use the Extended Euclid algorithm to find the secret key <math>d</math>. 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.

cs-312/hw4.1420066505.txt.gz · Last modified: 2014/12/31 15:55 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0