Project contributed by Neal Brand.
This project requires students to read about
the RSA method of encryption and then use Mathematica or other
software to break a code. Students are also required to generalize
the basic theorem used for RSA encryption and prove it. This
project requires students to read Section 1.5 of Abstract
Algebra by Nicholson. Of course, other sources for the
information could be used.
Project teaches and provides practice in
- Use of symbolic mathematical software
- Generalizing a result and proving it
- RSA method of encryption
Return to the UNT project home page.