Cryptography

 Cryptography introduces the underlying the principles and design of cryptosystems. The course covers the basics concepts of cryptography including: traditional ciphers, block ciphers, stream ciphers, public and private key cryptosystems. The course also includes the theory of hash functions, authentication systems, network security protocols and malicious logic.

The objectives of this course are to familiarize the students with cryptography and its applications. The students will be able to develop basic understanding of cryptographic mechanisms.

🕮 Syllabus

🕮 Books

🕮 Notes

🕮 Old Questions

🕮 Solutions

Labsheet

Comments

Post a Comment

Popular posts from this blog

System Analysis and Design

System Analysis and Design familiarizes students with the concepts of information systems development including systems development life cycle, different approaches to systems development, project management, planning, analysis, design, implementation and maintenance. This course also covers some fundamental concepts of object oriented systems analysis and design. The main objective of this course is to provide knowledge of different concepts of system analysis and design so that students will be able to develop information systems using different methodologies, tools, techniques, and approaches. 🕮  Syllabus 🕮  Books 🕮  Notes 🕮  Old Questions 🕮  Solutions
Read more

Design and Analysis of Algorithms

 Design and Analysis of Algorithms introduces basic elements of the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, divide and conquer strategy, greedy methods, dynamic programming, basic graph algorithms, NP-completeness, and approximation algorithms. For each topic, beside in-depth coverage, one or more representative problems and their algorithms shall be discussed. The major objectives of this course are: Analyze the asymptotic performance of algorithms. Demonstrate a familiarity with major algorithm design techniques Apply important algorithmic design paradigms and methods of analysis. Solve simple to moderately difficult algorithmic problems arising in applications. Able to demonstrate the hardness of simple NP-complete problems 🕮  Syllabus 🕮  Books 🕮  Notes 🕮  Old Questions 🕮  Solutions <p style="text-align: center;"><button class="myb" style="appearance: none; background-color: white; borde...
Read more