Fall 2009
Cryptology 1: MAPLE
[Home] [Course Description] [Literature] [Course Materials] [Assignments] [Maple
Worksheets] [Examinations] [Graduate Projects]
[Maple] [Cryptology
Blog]
One of the key features of modern cryptology is the use of complex operations on
very large positive integers. The objective of the course is to give you a
realistic exposure to the mathematics behind cryptology and the actual
computational issues. For this purpose one needs tools to assist with
computations involving large integers. There are several packages in different
programming languages available for multiprecision arithmetic (= computation
with large numbers). Maple is the most user friendly of these, because it has
several of the number theoretic functions we will need already implemented, and
it is programmable. Although it is not the objective of the course to teach
Maple there will be many opportunities to acquire the Maple skill level needed
to successfully complete computational tasks during the course. Some of these
opportunities include in class work, examples posted on the course web,
downloads of programs that I prepared for the course and practice exercises. I
require that by the time of the midterm test you know all the necessary
Maple commands, iterative structures ( "do loops"), conditional structures (" if
...then...") and syntax. Until that time I will be available for
consultations about Maple. Here you will find an introductory guide to Maple
programming.
Remember, Maple is only a tool to
present the concepts of cryptography more clearly.
give you a greater appreciation of how a cryptographic algorithm or protocol works.
motivate you and give you confidence that you are capable of not only understanding, but implementing the details of a security capability.