• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS MAT 5015 CRYPTOGRAPHY ELECTIVE 3 0 0 7

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

Offered to

Mathematics Mathematics

Course Objective

The aim of this course is to introduce the fundamental concepts in cryptography, and show its usage in the whole body of mathematics.

Learning Outcomes of the Course Unit

1   Will be able to use elementary number theory. 2   Will be able use to prime numbers. 3   Will be able to use basic cryptography. 4   Will be able to use factorization methods. 5   Will be able to use discrete logarithm problem.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Elementary number theory 2 Prime numbers 3 Permutation cryptography and shifting 4 Affine cryptography and matrices 5 Discrete logarithm problem 6 RSA 7 Factorization methods 8 Midterm 9 Primality tests 10 Key exchange 11 Elliptic curve cryptography 12 Elliptic curve factorization 13 Lattices 14 Analytic methods

Recomended or Required Reading

Textbook(s): [1] J. Hoffstein, J. Pipher, J. H. Silverman, An Introduction to Mathematical Cryptography, Springer, 2010. References: Materials: Instructor s notes and presentations

Planned Learning Activities and Teaching Methods

Lecture notes Presentation Problem solving

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 ASG ASSIGNMENT 3 RPT REPORT 4 FIN FINAL EXAM 5 FCG FINAL COURSE GRADE MTE * 0.30 +ASG +RPT/2 * 0.30 +FIN * 0.40 6 RST RESIT 7 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 +ASG +RPT/2 * 0.30 +RST * 0.40 *** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

haydar.goral@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Preparations before/after weekly lectures 13 3 39 Preparation for midterm exam 1 15 15 Preparation for final exam 1 25 25 Preparing assignments 10 5 50 Final 1 3 3 Midterm 1 3 3 TOTAL WORKLOAD (hours) 174

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 LO.1 4 3 3 2 2 2 4 3 3 3 LO.2 4 3 3 2 2 2 4 3 3 3 LO.3 4 3 3 2 2 2 4 3 3 3 LO.4 4 3 3 2 2 2 4 3 3 3 LO.5 4 3 3 2 2 2 4 3 3 3