Module: P-Key Cryptography & Sec Protocols

Module Specifications..

Current Academic Year 2023 - 2024

Please note that this information is subject to change.

Module Title	P-Key Cryptography & Sec Protocols
Module Code	CA646I
School	School of Computing
Module Co-ordinator	Semester 1: Irina Tal Semester 2: Irina Tal Autumn: Irina Tal
Module Teachers	Irina Tal
NFQ level	9	Credit Rating	7.5
Pre-requisite	None
Co-requisite	None
Compatibles	None
Incompatibles	None

Repeat examination

Description

This module introduces students to modern public-key cryptography and security protocols.

Learning Outcomes

1. Describe the fundamental concepts underpinning public-key cryptography, digital signature schemes and provable security.
2. Explain the mathematical concepts underlying RSA and ElGamal, and perform appropriate calculations and proofs using these concepts.
3. Describe and analyse public-key encryption schemes and digital signature schemes based on RSA and ElGamal.
4. Interpret and synthesize reductionist security arguments for differing security goals.
5. Design & write software to implement public-key encryption schemes and digital signature schemes based on RSA and ElGamal.
6. Describe the fundamental concepts underpinning security protocols, key management and public key infrastructures.
7. Describe and analyse security protocols for applications such as authentication, key-exchange, e-mail,e-cash, zero-knowledge protocols, bit-commitment protocols and fair-exchange protocols.
8. Design & write software to implement security protocols.

*Type*	*Hours*	*Description*
Workload	Full-time hours per semester
Lecture	36	Lecture
Independent Study	64	Private study/research
Assignment Completion	80	Math/Programming Exercises
Total Workload: 180

All module information is indicative and subject to change. For further information,students are advised to refer to the University's Marks and Standards and Programme Specific Regulations at: http://www.dcu.ie/registry/examinations/index.shtml

Indicative Content and Learning Activities

Assessment Breakdown
Continuous Assessment	25%	Examination Weight	75%

Type	Description	% of total	Assessment Date
Course Work Breakdown
Assignment	A collection of mathematical and coding tasks.	30%	n/a

Reassessment Requirement Type
Resit arrangements are explained by the following categories; 1 = A resit is available for all components of the module 2 = No resit is available for 100% continuous assessment module 3 = No resit is available for the continuous assessment component
This module is category 1

Indicative Reading List

Wenbo Mao: 2004, Modern Cryptography: Theory & Practice, Prentice Hall,
Katz & Lindell: 2008, Introduction to Modern Cryptography, Chapman & Hall,
Menezes, van Oorschot & Vanstone: 1997, Handbook of Applied Cryptography, CRC Press, http://www.cacr.math.uwaterloo.ca/hac/,

Other Resources

None

Programme or List of Programmes

MCM	M.Sc. in Computing

Archives: