Registry

Module Specifications

Current Academic Year 2012 - 2013
Please note that this information is subject to change.

Module Title
Module Code
School
Online Module Resources

Module Co-ordinatorSemester 1: David Gray
Semester 2: David Gray
Autumn: David Gray
Module TeacherDavid Gray
NFQ level 9 Credit Rating
Pre-requisite None
Co-requisite None
Compatibles None
Incompatibles None
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.



Workload Full-time hours per semester
Type Hours Description
Lecture36Lectures
Independent learning time60Private study/research
Assignment80Programming Exercises
Examination12Class tests
Total Workload: 188

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
Syllabus.
Review of symmetric & asymmetric cryptography, hash functions and random number generators; Complexity theory and probability; Public-key schemes and provable security; RSA and the hardness of factoring; ElGamal and the discrete log problem; Efficient implementation of basic algorithms and the RSA & ElGamal public-key schemes; Digital signature schemes based on RSA & ElGamal, and their implementation.Security objectives - confidentiality, integrity, authentication and non-repudiation; Key management and Public key Infrastructures; Authentication & key-exchange protocols; Secure e-mail; Advanced protocols – blind signatures, electronic cash, ZK protocols, identification schemes, bit-commitment protocols, two-party fair contract signing..

Assessment Breakdown
Continuous Assessment% Examination Weight%
Course Work Breakdown
TypeDescription% of totalAssessment Date
In Class TestTwo class tests held during the semester.30%n/a
Reassessment Requirement
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
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
Array
Programme or List of Programmes
Timetable this semester: Timetable for
Archives:
DCU
Address
The Helix
3U
NDP
Government
EU
Disclaimer | Privacy