MATH 4809.
Cryptography II
(Elliptic curve cryptography)
                        

Prof. Yuly Billig
Office: Herzberg 4221
e-mail: billig@math.carleton.ca
Tel.: 520-2600 ext. 4310
 
 
 
 

Topics covered:
 

• Elliptic curves
• Finite Fields
• Discrete logarithm cryptography
• ElGamal cryptosystem
• Factoring large integers
• Hyperelliptic Curves
• Abelian Varieties (if time allows)

We will be doing implementations of various cryptosystems using C/C++.
 

Pre-requisites:
 

• Cryptography I (MATH 3809),  (or by permission of instructor if you did not take that course but have knowledge of the basics of cryptography, e.g. RSA scheme).
• Some experience with C or C++ is desirable, but not required.

Office Hours: Thursday 2:30-3:30pm

Midterm Date: Thursday March 1, in class

An example of an NTL program (Right-click to download)

Save this program in your directory. To compile this program, use the following line:

g++ -I /files3/CUNET/yulybillig/NTL/include -L /files3/CUNET/yulybillig/NTL/lib example-NTL.cpp -o example-NTL -lntl -lm

This will create an executable file example-NTL. To run the program, type

./example-NTL

For more documentation, see NTL webpage , and in particular, the documentation files http://www.shoup.net/ntl/doc/ZZ.txt and http://www.shoup.net/ntl/doc/ZZ_p.txt

Instructions on installing Dev C++ and NTL on Windows (by John Quinn).

Sample NTL code for Assignment 4