SDU Education Information System
   Home   |  Login Türkçe  | English   
 
   
 
 


 
Course Information
Course Unit Title : Public Key Cryptography
Course Unit Code : 01MAT5190
Type of Course Unit : Optional
Level of Course Unit : Second Cycle
Year of Study : Preb
Semester : 255.Semester
Number of ECTS Credits Allocated : 6,00
Name of Lecturer(s) : ---
Course Assistants :
Learning Outcomes of The Course Unit : Idea of public key cryptography, Computational complexity and Number-theoretical algorithms, Knapsack, RSA, Primality and Factoring Algorithms.
Mode of Delivery : Face-To-Face
Prerequisities and Co-requisities Courses : Unavailable
Recommended Optional Programme Components : Unavailable
Course Contents : Idea of Public Key Cryptography, Computational Complexity and Number-theoretical algorithms. The Merkle-Hellman Knapsack System, Attacks on Knapsack Cryptosystems, RSA, Attacks to RSA, Primality and Factoring Algorithms.
Languages of Instruction : Turkish-English
Course Goals : Having the information about the fundamental ideas of public key cryptography. Understanding Knapsack, RSA, ElGamal cryptosystems and discuss the attacks to these systems.
Course Aims : The aim of this course is to introduce the fundamental ideas of public key cryptography and discuss some of the algorithms used. The emphasis will be in understanding Knapsack, RSA, ElGamal and discuss the attacks to these systems.
WorkPlacement   Not used.
Recommended or Required Reading
Textbook : -
Additional Resources : 1) N. Koblitz, Algebraic Aspects of Cryptography, Sringer, 1998.
2) N. Koblitz, A Course in Number Theory and Cryptography, Second Edition, Springer, 1994.
3) D. R. Stinson, Cryptography: Theory and Practice, Third Edition, CRC Press, 2005.
4) A. J. Menezes, P. C. van Oorschot, S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
5) R. A. Mollin, RSA and Public-Key Cryptography, CRC Press, 2003.
6) S. D. Galbraith, Mathematics of Public Key Cryptography, Cambridge University Press, 2012.
Material Sharing
Documents :
Assignments :
Exams :
Additional Material :
Planned Learning Activities and Teaching Methods
Lectures, Practical Courses, Presentation, Seminar, Project, Laboratory Applications (if necessary)
ECTS / Table Of Workload (Number of ECTS credits allocated)
Student workload surveys utilized to determine ECTS credits.
Activity :
Number Duration Total  
Course Duration (Excluding Exam Week) :
14 3 42  
Time Of Studying Out Of Class :
14 3 42  
Homeworks :
5 15 75  
Presentation :
0 0 0  
Project :
0 0 0  
Lab Study :
0 0 0  
Field Study :
0 0 0  
Visas :
1 30 30  
Finals :
1 30 30  
Workload Hour (30) :
30  
Total Work Charge / Hour :
0  
Course's ECTS Credit :
0      
Assessment Methods and Criteria
Studies During Halfterm :
Number Co-Effient
Visa :
1 25
Quiz :
0 0
Homework :
5 75
Attendance :
14 0
Application :
0 0
Lab :
0 0
Project :
0 0
Workshop :
0 0
Seminary :
0 0
Field study :
0 0
   
TOTAL :
100
The ratio of the term to success :
70
The ratio of final to success :
30
TOTAL :
100
Weekly Detailed Course Content
Week Topics  
1 Idea of Public Key Cryptography
 
2 Computational complexity
 
3 Divisibility and the Euclidean algorithm
 
4 P, NP, NP-Completeness
 
5 Superincreasing Sequence
 
6 Merkle-Hellman Knapsack Cryptosystem
 
7 Attacks on Knapsack Cryptosystem
 
8 RSA Cryptosystem
 
9 Attacks on RSA Cryptosystem
 
10 Discrete Logarithm Problem
 
11 ElGamal Cryptosystem
 
12 Primality and Factoring Algorithms.
 
13 Elliptic Curves
 
14 Elliptic Curve Cryptosystems
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0
 
0