Registry

Module Specifications

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

Module Title Cryptography & Number Theory
Module Code CA642
School School of Computing
Online Module Resources

Module Co-ordinatorSemester 1: Geoffrey Hamilton
Semester 2: Geoffrey Hamilton
Autumn: Geoffrey Hamilton
Module TeacherGeoffrey Hamilton
NFQ level 8 Credit Rating 7.5
Pre-requisite None
Co-requisite None
Compatibles None
Incompatibles None
Description
The purpose of this module is to introduce the students to elementary number theory, as required for further study of important cryptographic protocols, and to teach the basics of modern symmetric cryptography. Modern block ciphers and hash functions will be studied in some depth, and modern complex methods of block cipher cryptanalysis (linear and differential) will be covered. Participants will learn to appreciate the significance of cryptography as a means of securing information in the modern world. New ideas and some surprising and novel protocols will be discussed. Students are expected to attend lectures, to undertake a difficult assignment, and partake in external reading and study and homework.

Learning Outcomes
1. Understand the significance of cryptography to the modern world and the internet.
2. Understand the rationale behind block cipher design.
3. Perform the cryptanalysis of a simple block cipher
4. Integrate cryptographic algorithms into software projects
5. Solve elementary problems in number theory relating to cryptography
6. Build on number theoretic basics to further their knowledge of advanced methods of cryptography



Workload Full-time hours per semester
Type Hours Description
Lecture36No Description
Examination3No Description
Assignment48Project work
Independent learning time100HOme work, home study
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
Classical method of Cryptography.
The Caesar cipher. The Vigenere cipher. Rotor machines. The one-time pad..

Modern ciphers and hash functions.
Structure of a block cipher. The Fiestel structure. Key and block size length. DES, AES, IDEA, RC5, SAFER, FEAL-4 and other block ciphers. Stream ciphers and LFSRs. One-way hash functions, SHA-1 and its successors..

Cryptanalysis.
Cryptanalysis of FEAL-4 using linear and differential cryptanalysis. Meet-in-the-middle attacks..

Key distribution.
The key distribution problem. The padlock analogy and the Diffie-Hellman method. An introduction to RSA and related methods..

Smartcards.
Smartcard technology. Side channel attacks. Challenge response systems. The surprising applications of an uncloneable one-way function. Mobile phone SIM cards..

Elementary number theory.
Finite fields. Modular arithmetic. Efficient algorithms for modular arithmetic. Fermats theorem. Euler's criteria, and the totient function..

Advanced number theory.
Primality proving. The Chinese remainder theorem. Quadratic residues and calculating modular square roots and cube roots. The Jacobi symbol..

Assessment Breakdown
Continuous Assessment25% Examination Weight75%
Course Work Breakdown
TypeDescription% of totalAssessment Date
AssignmentPerform the cryptanalysis of a block cipher25%Week 6
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
  • Menezes at al.: 2001, Handbook of Applied Cryptography, CRC Press, http://www.cacr.math.uwaterloo.ca/hac/, 0-8493-8523-7
  • Kumanduri and Romero: 1998, Number Theory with Computer Applications, Prentice-Hall, New Jersey,
  • N. Smart: 2009, Cryptography, an Introduction, 3rd, http://www.cs.bris.ac.uk/~nigel/Crypto_Book/,
Other Resources
None
Array
Programme or List of Programmes
BSSAStudy Abroad (DCU Business School)
BSSAOStudy Abroad (DCU Business School)
CAPDPhD
CAPMMSc
CAPTPhD-track
ECSAStudy Abroad (Engineering & Computing)
ECSAOStudy Abroad (Engineering & Computing)
EEPDPhD
EEPMMEng
EEPTPhD-track
GCSFGrad Cert in Security & Forensics
GDSFGraduate Diploma in Security & Forensics
HMSAStudy Abroad (Humanities & Soc Science)
HMSAOStudy Abroad (Humanities & Soc Science)
MCMM.Sc. in Computing
MEPDPhD
MEPMMEng
MEPTPhD-track
MSSFMSc in Security & Forensic Computing
SHSAStudy Abroad (Science & Health)
SHSAOStudy Abroad (Science & Health)
Timetable this semester: Timetable for CA642
Date of Last Revision28-JUL-08
Archives: