Registry

Module Specifications

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

Module Title	Cryptography and Security Protocols
Module Code	CA547
School	School of Computing
Online Module Resources
Module Co-ordinator	Semester 1: Geoffrey Hamilton Semester 2: Geoffrey Hamilton Autumn: Geoffrey Hamilton
Module Teacher	Geoffrey Hamilton
NFQ level	8	Credit Rating	0
Pre-requisite	None
Co-requisite	None
Compatibles	None
Incompatibles	None

Description

The purpose of this module is to introduce the student to some of the latest ideas, algorithms and protocols from Modern Cryptology and Secure Communications, and to equip the student to apply this theory to the problems of building secure computer applications, and securing communications in the context of the internet and e-commerce. Modern block ciphers and hash functions and their aplications are covered. Then, based on the students prior experience of elementary arithmetic, the basics of number theory are taught, as needed to fully understand the main algorithms for public-key cryptography, such as the RSA method. Based on this introduction to cryptology, the student is introduced to the basic concepts of security protocols and their implementation.

Learning Outcomes

1. Solve elementary problems in number theory relating to cryptography.
2. Understand contemporary private and public key encryption algorithms
3. Understand the techniques available for securing information in the context of the modern world.
4. To integrate cryptographic code into software projects.
5. Appreciate the basic threat models that need to be countered in secure systems, and how cryptography can help.
6. Describe the fundamental concepts underpinning security protocols, key management and public keyinfrastructures.
7. Describe and analyse security protocols for applications such as authentication and key-exchange.e-mail.
8. Design & write software to implement security protocols

Workload	Full-time hours per semester
*Type*	*Hours*	*Description*
Lecture	24	No Description
Assignment	40	Working on projects
Independent learning time	61	Homework, self-directed study
Total Workload: 125

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

Classical methods.
Caesar cipher. The one-time pad. Mechanical Rotor systems..

Symmetric cryptography.
Block ciphers and their applications. Modes of operation. One-way hash functions and their aplications. The Data Encryption Standard (DES) and the Advanced Encryption Standard (AES).

Elementary Number theory.
Fermat's theorem. Finite fields. Modular arithmetic. Fast algorithms for modular arithmetic..

Public Key Cryptography.
The key distribution problem and Public Key Infrastructures. The RSA method. Diffie-Hellman and El Gamal. The DSA digital signature..

Hard problems.
One way functions. The integer factorisation problem, and the discrete logarithm problem..

Random number generation.
Cryptographically secure random numbers and their generation. Using one-way hash functions. The BBS generator..

Security Objectives.
Confidentiality, integrity, authentication and non-repudiation..

Security Protocols.
Authentication and key-exchange..

Assessment Breakdown
Continuous Assessment	30%	Examination Weight	70%

Course Work Breakdown
Type	Description	% of total	Assessment Date
Assignment	Implement a cryptographic algorithm	15%	Week 6
Assignment	Implement a security protocol	15%	Week 12

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 3

Indicative Reading List