RSA Implementation

Overview

The RSA algorithm data consists of a public key and a private key. (See here, for example, for more details.)

The public key consists of a modulus which we denote n, and an exponent which we denote e. If the message consists of a number x, the encoded message consists of the number

xe mod n.

In this problem, you have to generate a public key and private key pair and enter the public key below. You will then receive an encrypted number. You need to decrypt this number using your private key and email the result back to me.

The message consists of a number not more than several digits long that is generated randomly for each student. Don't expect to get the same result as other students in the class!


Please fill in the entries below.

Name:

email:


Enter the two numbers for the public key below. Extra credit will be given if these numbers are large. Any spaces, commas, newlines, backslashes, etc will be removed automatically so don't worry about them.

Modulus n:

Exponent e:


Return to: Math 121 * My Home Page * Department of Mathematics * Duke University

Last modified: