Date 
No. 
Title 
11 Sep 17  01

Course Information

 *

Public Key Cryptography (2pp.)

 *

The Dancing Men

13 Sep 17  *

The BigO Notation

 *

The Number of Digits

 *

Bit Operations

 *

Polynomial Time Algorithms

14 Sep 17  *

The Division Algorithm

 *

The Euclidean Algorithm

 *

The Euclidean Algorithm II

18 Sep 17  *

Implementing the gcd in Maple (2pp)

 *

The Euclidean Algorithm (Maple pgm  2pp)

 *

The Extended Euclidean Algorithm

 *

The Extended Euclidean Algorithm:
Examples 1 and 2 (2pp.)

20 Sep 11  *

MAPLE homework instructions

 *

MAPLE hints

 *

Basic MAPLE Commands (4pp.)

 *

The Extended Euclidean Algorithm
(Matrix Method) (2pp.)

 *

The Euclidean Algorithm
(Maple Program  2pp.)

 *

Solving mx + ny = c

21 Sep 17  *

Modular Arithmetic

 *

Solving mx + ny = c and ax = b (mod m)

25 Sep 17  *

The Euler phifunction (2pp.)

27 Sep 17  *

The Chinese Remainder Theorem (4pp.)

28 Sep 17  *

The Binary Power Method (3pp.)

 *

Review of time estimates for algorithms

02 Oct 17  *

The Definition of Cryptosystems

 *

Classical Cryptosystems (2pp.)

04 Oct 17  *

Tasks for Public Key Cryptography

 *

The RSA Method (4pp.)

05 Oct 17  *

Design Features of RSA Keys

 *

The RSA Challenge (2pp.)

 *

The Discrete Log Problem (2pp.)

11 Oct 17  *

The Order of a Group Element (2pp.)

12 Oct 17  *

Orders of elements mod 11

16 Oct 17  *

The existence of generators

 *

DLCryptosystems

 *

History of DLCryptosystems
