Possible topics for Math 116 project
Here are some possible topics for your term paper/project. These are just suggestions, just some
of many possibilities. If you think of a cryptography-related topic that interests you that's not on this
list, just run
Due Monday, January 25, 2016
Please read sections 2.12.3, 2.72.9, and 2.11 of your textbook. You might also nd
the remaining sections of chapter 2 (especially 2.5 and 2.12) fun and interesting.
Do Problems 19, 20, and 25 at the end o
Math 116: Mathematical Cryptology
Instructor: Will Conley
Office: MS 6322
Office Hours: Wed 3:305:00pm, Thurs 12:302:00pm
Any other time by appointment.
Email: [email protected]
Lectures: MWF 10:0010:5
Due Thursday, February 25, 2016
Do the following problems:
1. Let R be a ring. Prove that the following are equivalent statements about R:
(1) For all a, b R, if ab = 0 then a = 0 or b = 0.
(2) For all a, b, c R, if ab = ac and a = 0
Due Thursday, January 14, 2016
Please read Chapter 1 in the textbook.
1. For each of the following, nd the unique integer between 0 and n 1 that is equivalent
to the expression given (where n is the modulus in the expression). Do these
For homework 2 (and some later homework assignments) you will probably want to use a
computer and do a little coding. How much or how little of this you do is up to you. In
theory, its certainly possible to do everything by hand, but this wil
MATH 116, Mathematical Cryptology
Due: January 20, 2017
Problem 1.2 in the textbook. In each case, also determine the key.
Problem 1.14 in the textbook.
Let a = 123, b = 71. Use the Extended Euclidean Algo