
Academic Year:  2018/9  
Owning Department/School:  Department of Computer Science  
Credits:  6 [equivalent to 12 CATS credits]  
Notional Study Hours:  120  
Level:  Honours (FHEQ level 6)  
Period: 
 
Assessment Summary:  EX 100%  
Assessment Detail: 
 
Supplementary Assessment: 
 
Requisites: 
Before taking this module you must ( take CM10227 OR take XX10190 ) AND ( take 2 MODULES FROM {CM10196, CM20217} OR take MA10209 )
An elementary knowledge of number theory, as in chapters 12 of Davenport The Higher Arithmetic, is required to take this unit.  
Description:  Aims: To introduce students to the techniques, tools and pitfalls of cryptography (including authentication etc.). Learning Outcomes: 1. Students will understand the basic mathematics behind privatekey and publickey cryptography; 2. Students will be able to describe several wellknown techniques for cryptographic security and authentication. Skills: Application of Number (T/F, A), Problem Solving (T/F). Content: Introduction to the problem: security, privacy, authentication, repudiation, revocation. The key distribution problem: public vs private keys. The mathematics of cryptography: FermatEuler Theorem, structure of finite fields and elliptic curves. Cryptographic algorithms: DiffieHellman, RSA, ElGamal. Cryptanalysis: discrete logarithms, factoring. The Coppersmith attack. Elliptic Curve analogues. Privatekey algorithms: DES, 3DES and AES. Common hashing algorithms: MD5, SHA1. Characteristics of safe keys. Using cryptography: digital signatures: how to find the public key.Repudiation and revocation, examples in practice: PGP, digital certificates.  Before taking this module you must ( take CM10196 OR take MA10209 ) AND ( take CM10227 OR take XX10190 ) AND take CM20217 An elementary knowledge of number theory, as in chapters 12 of Davenport The Higher Arithmetic, is required to take this unit. 
Programme availability: 
CM30173 is Optional on the following programmes:Department of Computer Science

Notes:
