MCS 427 – Public Key Cryptography

 

 

 

 

 

Department of Mathematics and Computer Sciences

 

 

 

 

Theor.

Appl.

Lab.

Intern.

Project/Field

Other

Total

 

Credit

ECTS

Methods of

 

Work

 

Credit

lnstruction

 

 

 

 

 

 

 

 

 

 

 

 

42

 

-

-

 

-

-

42

(3 O 3)

3

Semester

i

 

 

 

 

 

 

 

 

 

lnstructor

 

 

 

 

 

 

 

 

 

 

Schedule

 

 

 

 

 

 

 

 

 

 

 

Office Hours

 

 

 

 

 

 

Prerequisite

None

 

 

 

 

 

 

 

 

 

 

 

Time estimates for doing aritlımetic, complexity of some number theoretic algorithms,

Catalog

some simple cryptosystems, the idea ofpublic key cryptosystems, RSA cryptosystem,

Description

primality tests, attacks on RSA cryptosystems: Fermat factorization, factor base

 

algorithms, the PoUard's rho, PoUard's p-l, quadratic sieve factoring, RSA digital

 

signature, generating cryptographically good RSA parameters.

 

 

 

 

Textbook

Neal Koblitz, A Course in Number Theory and Cryptography, Springer (QA 241.K672)

Reference

Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone: Handbook of Applied

Books

Cryptography. CRC Press, 1996.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Number of

 

Perceııtages

 

 

Midterm Exams

 

 

2

 

 

 

50

 

 

 

Quiz

 

 

 

-

 

 

 

-

 

 

Homework

 

 

 

-

 

 

 

 

EvaIuation

 

Project

 

 

 

 

 

 

 

 

Criteria

 

 

 

 

-

 

 

 

 

 

 

Term Homework

 

 

-

 

 

 

 

 

 

Laboratory Work

 

 

-

 

 

 

 

 

 

Class Participation

 

Attendance

 

 

10

 

 

Final Exam

 

 

 

ı

 

 

i

40

Exam Dates

Announced later.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Course Description Details

Week

ı

Dates

i

Topics covered

!

 

,

 

 

 

1

i

26. 09 - 30. 09

Time estimates for doing arithmetic

i

2

i

03. 10 - 07. 10

Complexity of some number theoretic algorithms

3

 

10. 10 - 14. 10

Complexity of some number theoretic algorithms

4

i

17. 10 - 21. 10

Some simple cryptosystems, the idea ofpublic key

 

cryptosystems

 

 

ı

 

 

 

5

 

24.10-28.10

RSA cryptosystem

 

6

 

31. i 0- 04. II

Primality tests

 

7

 

07. II - lL. II

Fermat factorization, Factor base algorithms

8

ı

14. II - 18. II

Applications

 

9

i

21. 11 - 25. 11

Pollards rho, Pollard's p-1

10

 

28. II - 02. 12

Quadratic Sieve factoring

II

 

05. 12 - 09. 12

RSA digital signature, applications

12

 

12. 12 - 16. 12

Generating cryptographically good RSA parameters

13

 

19. 12 - 23. 12

Implementing RSA

 

14

 

26. 12 - 30. 12

Review