DCU Home | Our Courses | Loop | Registry | Library | Search DCU
<< Back to Module List

Module Specifications.

Current Academic Year 2024 - 2025

All Module information is indicative, and this portal is an interim interface pending the full upgrade of Coursebuilder and subsequent integration to the new DCU Student Information System (DCU Key).

As such, this is a point in time view of data which will be refreshed periodically. Some fields/data may not yet be available pending the completion of the full Coursebuilder upgrade and integration project. We will post status updates as they become available. Thank you for your patience and understanding.

Date posted: September 2024

Module Title Secure Sys Admin & Internetwork Security
Module Code EE538 (ITS) / EEN1080 (Banner)
Faculty Engineering & Computing School Electronic Engineering
Module Co-ordinator-
Module Teachers-
NFQ level 9 Credit Rating 7.5
Pre-requisite Not Available
Co-requisite Not Available
Compatibles Not Available
Incompatibles Not Available
Repeat examination
Repeat exam in the Autumn
Description

This module introduces the student to the areas of cryptography and cryptanalysis. It provides a basic understanding of the algorithms used to protect users online and to understand some of the design choices behind these algorithms. The student will develop a workable knowledge of the mathematics used in cryptology and this will allow them to understand attacks on cryptosystems with the aim of preventing future attacks. This module will also provide a sufficient familiarity with managing multi-user computer systems and an adequate knowledge of how to protect systems from network based attacks in order to guarantee the authenticity and non-disclosure of data. This module is not accessible to off-campus students because the associated labs involve interaction with fellow students and demonstrators.

Learning Outcomes

1. describe the fundamental principles and technology which underlie secure data communications over networks and how they apply in particular cases.
2. demonstrate the use of the mathematics behind cryptographic algorithms and be able to describe the hardware architectures required to implement these systems.
3. describe recently developed attacks on cryptographic systems and how these can be thwarted.
4. perform, at an advance level, system administrator duties on a multi-user based computer system, e.g. Linux-type operating system.
5. exploit core self-learning skills to acquire knowledge on system administration and security, thus ensuring secure and reliable systems.
6. demonstrate technical writing skills.



Workload Full-time hours per semester
Type Hours Description
Lecture363 hours a week
Laboratory16eight 2hr lab sessions
Assignment Completion16Write up the 8 lab sessions
Assignment Completion16An assignment to implement two random number generators, evaluate and compare their prosperities
Independent Study100Self study on the subject
Directed learning3End of Module Formal Examination
Total Workload: 187

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

Overview of security, threats and mechanisms

Conventional encryption algorithms - DES, AES

Mathematics used in cryptology - Number Theory, Abstract Algebra

Public key cryptography, RSA, key management, confidentiality, authentication and digital signatures

Side Channel attacks

The Linux operating system in the context of security and system administration

Wireless (802.xx) security threats, hacking mechanisms, and improvements

Firewalls and other network structures to ensure data integrity and network security

Assessment Breakdown
Continuous Assessment0% Examination Weight0%
Course Work Breakdown
TypeDescription% of totalAssessment Date
Laboratory PortfolioThere are eight 2hr lab sessions, Write up the 8 lab sessions30%As required
ProjectAn assignment to implement two random number generators, evaluate and compare their prosperities10%As required
Reassessment Requirement Type
Resit arrangements are explained by the following categories:
Resit category 1: A resit is available for both* components of the module.
Resit category 2: No resit is available for a 100% continuous assessment module.
Resit category 3: No resit is available for the continuous assessment component where there is a continuous assessment and examination element.
* ‘Both’ is used in the context of the module having a Continuous Assessment/Examination split; where the module is 100% continuous assessment, there will also be a resit of the assessment
This module is category -
Indicative Reading List

  • W. Stallings: 2006, Cryptography and Network Security - Principles and Practice, 4th ed., Prentice Hall,,
  • Ross J. Anderson: 2001, Security engineering - A Guide to Building Dependable Distributed Systems, John Wiley & Sons, New York, 0-471-38922-6
  • James F. Kurose, Keith W. Ross: 2007, Computer Networking - A Top-Down Approach, 4th Ed., Addison Wesley, ISBN: 0-321-49770-8
Other Resources

804, Website, Novell Inc., 0, OpenSUSE Reference, the edition is linked to the release version of Ed.,

<< Back to Module List