CE 340 | Course Introduction and Application Information

Course Name
Cryptography and Network Security
Code
Semester
Theory
(hour/week)
Application/Lab
(hour/week)
Local Credits
ECTS
CE 340
Fall/Spring
1
2
3
5

Prerequisites
None
Course Language
English
Course Type
Elective
Course Level
First Cycle
Course Coordinator -
Course Lecturer(s)
Assistant(s) -
Course Objectives This course will introduce cryptography theories, algorithms, and systems. It will also consider necessary approaches and techniques to build protection mechanisms in order to secure computer networks
Course Description The students who succeeded in this course;
  • will be able to define threats to computer networks and protection mechanisms and methods needed to thwart these threats,
  • will be able to describe the theory of the fundamental cryptography, encryption, and decryption algorithms,
  • will be able to build simple cryptosystems by applying encryption algorithms with Python,
  • will be able to classify secure identity management (authentication), message authentication, and digital signature techniques,
  • will be able to practice packet generation and observation tools such as Python/scapy and Wireshark.
Course Content To acquaint students with the major cryptography algorithms, systems, functions, and development techniques applied to network security mechanisms, and to introduce literature and terminology used for cryptography and network security.

 



Course Category

Core Courses
X
Major Area Courses
Supportive Courses
Media and Management Skills Courses
Transferable Skill Courses

 

WEEKLY SUBJECTS AND RELATED PREPARATION STUDIES

Week Subjects Related Preparation
1 Fundamental Concepts Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch1.1 pp. 1-14
2 Cryptographic Concepts Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch1.2 pp. 19-31
3 Symmetric Cryptography Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch2.1 pp. 53-68
4 Publi-Key Cryptography Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch2.2 pp. 72-81
5 Cryptographic Hash Functions Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch2.3-Ch2.4 pp. 83-88
6 Digital Signatures Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch2.4-Ch2.5 pp. 89-97
7 Operating Systems Security Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch3 pp. 111-157
8 Malicious Software Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch4 pp. 167-208
9 Network Security Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch5.1-Ch5.2 pp. 215-227
10 Network Security Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch5.3-Ch5.6 pp. 230-256
11 Network Services & Security Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch6 pp. 261-310
12 Browser Security Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch7 pp. 319-372
13 Security Models & Practice Introduction to Computer Security - M. T. Goodrich and R. Tamassia – Ch9 pp. 435-474
14 Project Presentations -
15 Project Presentations
16 Final Examination

 

Course Notes/Textbooks Introduction to Computer Security - M. T. Goodrich and R. Tamassia, © 2011 | Pearson Prentice Hall | ISBN-13: 978-0-321-70201-2, ISBN-10: 0-321-70201-8
Suggested Readings/Materials Information Security Lecture Notes: Süleyman Kondakcı

 

EVALUATION SYSTEM

Semester Activities Number Weigthing
Participation
16
10
Laboratory / Application
Field Work
Quizzes / Studio Critiques
Homework / Assignments
Presentation / Jury
Project
2
60
Seminar / Workshop
Portfolios
Midterms / Oral Exams
Final / Oral Exam
1
30
Total

Weighting of Semester Activities on the Final Grade
18
70
Weighting of End-of-Semester Activities on the Final Grade
1
30
Total

ECTS / WORKLOAD TABLE

Semester Activities Number Duration (Hours) Workload
Course Hours
Including exam week: 16 x total hours
16
1
16
Laboratory / Application Hours
Including exam week: 16 x total hours
16
2
Study Hours Out of Class
10
2
Field Work
Quizzes / Studio Critiques
Homework / Assignments
Presentation / Jury
Project
2
27
Seminar / Workshop
Portfolios
Midterms / Oral Exams
Final / Oral Exam
1
28
    Total
150

 

COURSE LEARNING OUTCOMES AND PROGRAM QUALIFICATIONS RELATIONSHIP

#
Program Competencies/Outcomes
* Contribution Level
1
2
3
4
5
1 Adequate knowledge in Mathematics, Science and Software Engineering; ability to use theoretical and applied information in these areas to model and solve Software Engineering problems X
2 Ability to identify, define, formulate, and solve complex Software Engineering problems; ability to select and apply proper analysis and modeling methods for this purpose X
3 Ability to design, implement, verify, validate, measure and maintain a complex software system, process or product under realistic constraints and conditions, in such a way as to meet the desired result; ability to apply modern methods for this purpose
4 Ability to devise, select, and use modern techniques and tools needed for Software Engineering practice
5 Ability to design and conduct experiments, gather data, analyze and interpret results for investigating Software Engineering problems
6 Ability to work efficiently in Software Engineering disciplinary and multi-disciplinary teams; ability to work individually
7 Ability to communicate effectively in Turkish, both orally and in writing; knowledge of a minimum of two foreign languages
8 Recognition of the need for lifelong learning; ability to access information, to follow developments in science and technology, and to continue to educate him/herself
9 Awareness of professional and ethical responsibility
10 Information about business life practices such as project management, risk management, and change management; awareness of entrepreneurship, innovation, and sustainable development
11 Knowledge about contemporary issues and the global and societal effects of engineering practices on health, environment, and safety; awareness of the legal consequences of Software Engineering solutions X

*1 Lowest, 2 Low, 3 Average, 4 High, 5 Highest