Module Details
Module Code: |
COMP9012 |
Title: |
Applied Cryptography
|
Long Title:
|
Applied Cryptography
|
NFQ Level: |
Expert |
Valid From: |
Semester 1 - 2020/21 ( September 2020 ) |
Field of Study: |
4811 - Computer Science
|
Module Description: |
The growth in application of cryptographic methods to computing systems and networks has resulted in a significant increase in the security of these systems. When comprimised, most of these methods are subverted as a result of inappropriate deployment. This module will address both the theoretical and practical aspects of symmetric and public-key cryptography, including cryptanalytic techniques. It integrates the concepts by considering the design of a typical public key infrastructure.
|
Learning Outcomes |
On successful completion of this module the learner will be able to: |
# |
Learning Outcome Description |
LO1 |
Analyse and model the mathematical foundations to modern cryptographic techniques. |
LO2 |
Critically evaluate modern symmetric and asymmetric cryptographic techniques. |
LO3 |
Appraise the security of deployed cryptographic systems |
LO4 |
Employ modern cryptographic techniques to enhance overall system security. |
LO5 |
Evaluate modern cryptographic techniques, such as Digital Signatures and Hashing. |
Dependencies |
Module Recommendations
This is prior learning (or a practical skill) that is strongly recommended before enrolment in this module. You may enrol in this module if you have not acquired the recommended learning but you will have considerable difficulty in passing (i.e. achieving the learning outcomes of) the module. While the prior learning is expressed as named MTU module(s) it also allows for learning (in another module or modules) which is equivalent to the learning specified in the named module(s).
|
|
Incompatible Modules
These are modules which have learning outcomes that are too similar to the learning outcomes of this module. You may not earn additional credit for the same learning and therefore you may not enrol in this module if you have successfully completed any modules in the incompatible list.
|
No incompatible modules listed |
Co-requisite Modules
|
No Co-requisite modules listed |
Requirements
This is prior learning (or a practical skill) that is mandatory before enrolment in this module is allowed. You may not enrol on this module if you have not acquired the learning specified in this section.
|
No requirements listed |
Indicative Content |
Mathematical Foundations
Assessing Number Theory, Euclidean Algorithm, Discrete Logs, Galois Fields, irreducible polynomials, Elliptic Curves
|
Symmetric Cryptography
Examining Feistel, DES, Multiple Encryption, AES, modes of operation, attacks, design issues
|
Asymmetric Cryptography
Analysing RSA, factoring, ECC, Discrete Log Schemes, Post-Quantum Cryptography, NIST and post-quantum, attacks on asymmetric ciphers
|
Ciphers
The One-Time Pad, Psuedo Random Generators, Perfect Secrecy, Security Measures and Definitions, Indistinguishability, Statistical Tests, Semantic Security.
|
Applied Cryptography
Application of Key Exchange, Diffie-Hellmann, Public Key Infrastructures, examples of how poor implementation has led to insecure systems, SSL/TLS in detail
|
Related Topics
Discussing Hash Functions, MACs, Digital Signatures, Secret Sharing, Stenography, CryptoCurrencies, BlockChains
|
Module Content & Assessment
|
Assessment Breakdown | % |
Coursework | 100.00% |
Assessments
No End of Module Formal Examination |
Reassessment Requirement |
Coursework Only
This module is reassessed solely on the basis of re-submitted coursework. There is no repeat written examination.
|
The University reserves the right to alter the nature and timings of assessment
Module Workload
Workload: Full Time |
Workload Type |
Contact Type |
Workload Description |
Frequency |
Average Weekly Learner Workload |
Hours |
Lecture |
Contact |
Lecture delivering theory underpinning learning outcomes. |
Every Week |
2.00 |
2 |
Lab |
Contact |
Lab to support learning outcomes. |
Every Week |
1.00 |
1 |
Independent & Directed Learning (Non-contact) |
Non Contact |
Independent study. |
Every Week |
4.00 |
4 |
Total Hours |
7.00 |
Total Weekly Learner Workload |
7.00 |
Total Weekly Contact Hours |
3.00 |
Workload: Part Time |
Workload Type |
Contact Type |
Workload Description |
Frequency |
Average Weekly Learner Workload |
Hours |
Lecture |
Contact |
Lecture delivering theory underpinning learning outcomes. |
Every Week |
2.00 |
2 |
Lab |
Contact |
Lab to support learning outcomes. |
Every Week |
1.00 |
1 |
Independent & Directed Learning (Non-contact) |
Non Contact |
Independent study. |
Every Week |
4.00 |
4 |
Total Hours |
7.00 |
Total Weekly Learner Workload |
7.00 |
Total Weekly Contact Hours |
3.00 |
Module Resources
|
Recommended Book Resources |
---|
-
William Stallings. (2016), Cryptography & Network Security: Principles and Practice, 7th edition. Pearson, [ISBN: 9781292158587].
| Supplementary Book Resources |
---|
-
Adam J. Elbirt. (2009), Understanding and Applying Cryptography and Data Security, CRC Press, [ISBN: 9781420061604].
-
Christopher Swenson. (2008), Modern Cryptanalysis: Techniques for Advanced Code Breaking, Wiley, [ISBN: 978-0470135938].
-
Christof Paar. (2010), Understanding Cryptography: A Textbook for Students and Practitioners, Springer, [ISBN: 3642041000].
-
Anish Nath. (2018), The Modern Cryptography CookBook: Learn from Crypto Prinicple to Applied Cryptography with Examples, Independent, [ISBN: 978171810471].
| Recommended Article/Paper Resources |
---|
-
Anand, Dhananjay, Vineeta Khemchandani,
and Ratnesh K. Sharma.. (2013), Identity-based cryptography techniques
and applications (a review)., IEEE Computational Intelligence and
Communication Networks (CICN), 2013.
-
Saranya, K., R. Mohanapriya, and J.
Udhayan.. (2014), A Review on Symmetric Key Encryption
Techniques in Cryptography., International Journal of Science,
Engineering and Technology Research,
539-544., Volume 3.
-
Kumar, Shyam Nandan.. (2015), Review on Network Security and
Cryptography., International Transaction of Electrical
and Computer Engineers System, 1-11., Volume 3.
| Other Resources |
---|
-
website, Cryptopals Crypto Challenges,
|
|