This programme addresses the growth in interest in advanced security methods for solving a huge range of problems, including combating crime and terrorism. It is built around taught core modules such as cryptography and information security, access control and privacy policies and computer forensics and cybercrime. These modules are complemented by a range of optional modules that relate to various aspects of computing. The final part of the programme is an individual project which is closely linked with the Department's research activities.
Compulsory Modules:
Optional Modules:
Lectures; tutorials; seminars; laboratory sessions; optional career planning workshops. Assessed through: coursework; written examinations; final project report.
Aims
To introduce the underlying concepts and practical applications of information security engineering at a level that reflects the current state-of-the-art.
Learning Outcomes
On successful completion of this module, you should be able to understand in detail how different types of attacks on computer systems and networks are carried out; understand how such attacks can be reliably prevented or detected.
Provisional Syllabus
Minimal Linux and scripting
Physical attacks
DNS, queries and resolvers, DNS poisoning
ARP, principles, spoofing and poisoning
Network and port scanning
Network packet factory
Firewall and Intrusion Detection technologies
Web security: server side (SQL, Xpath and code injections)
Web security: client side (Phishing, XSS)
Email security
Aims
The aim of this module is to define, analyse and compare abstract models of computation and their associated programming paradigms.
Learning Outcomes
On successfully completing the module you should be able to demonstrate a deep knowledge and understanding of the fundamentals of formal languages and the principal models of computation and be able to work with theoretical/research-based knowledge at the forefront of the subject; judiciously apply and combine tools and techniques (frequently in novel ways) to solve a range of complex subject-specific problems with minimal direction; analyse subject material, draw inferences, and find relationships that demand that innovative thinking be engaged in and creativity be exhibited in formulating solutions; critically evaluate, exercise judgement, and compare and contrast relevant material with minimal guidance and to consider and argue for alternative, novel approaches; demonstrate a high degree of independence in managing your own learning and reflecting upon it in order to complete research tasks autonomously.
Provisional Syllabus
Introduction to abstract models of computation
Finite Automata, Push-Down Automata and applications to parsing
Turing machines
Functional calculi
Interaction-based systems
Concurrent computation
Aims
To introduce both theoretical and practical aspects of cryptography, authentication and information security.
Learning Outcomes
On successful completion of this module, you should be able to understand the relevant mathematical techniques associated with cryptography; understand the principles of cryptographic techniques and perform implementations of selected algorithms in this area; appreciate the application of security techniques in solving real-life security problems in practical systems.
You should note that this module contains several advanced mathematical techniques. For students having a reasonable mathematical background, it should not be a problem. Explanations are given during the lectures/tutorials and examples are studied in details. Nevertheless, an in-depth understanding of these techniques is required for the examination and personal work has to be anticipated.
Provisional Syllabus
Basic terminology and concepts:
Goals of cryptography, terminology and notation players; Basic cryptographic functions
Number theory preliminaries:
Congruent modulo n, equivalent class modulo n; Integer modulo n (Zn):
Multiplicative inverse:
Relatively prime; Euler‟s theorem; Fermat‟s little theorem:
EEA (Extended Euclidean Algorithm)
CRT (Chinese Remainder Theorem)
Ciphers:
Block ciphers (substitution, transposition, product); Stream ciphers; Modes of operation (ECB, CBC, CFB, OFB)
Cryptosystems:
Block cipher: DES (Data Encryption Standard), AES (Advanced Encryption Standard)
Public-key: RSA (Rivest-Shamir-Adelman), El gamal
One-way hash function: SHA and MD5 (Message Digest 5)
Key-establishment protocols:
Symmetric and asymmetric techniques (Diffie-Hellman, Needham-Schroeder, Otway-Rees)
Public-key encryption, basic and advanced Kerberos protocols
Authentication and identification:
Concepts; Fiat-Shamir and Feige-Fiat-Shamir protocols; Zero-knowledge identification protocol
Digital signatures:
Classification; Digital signature schemes: RSA; El-Gamal; DSA (Digital Signature Algorithm) and DSS (Digital Signature Standard)
Information Security:
Password systems: number of acceptable passwords for a given password policy, exhaustive search
password ageing
Introduction to viruses, secure communication, social engineering (phishing), firewalls, buffer overflow, denial of services
Aims
To convey an understanding of the basic elements of software measurement and testing, in particular focusing on automated test data generation and with a discussion of the relative strengths and weakness of each technique.
Learning Outcomes
To be able to describe, apply and critique several well-known software metrics. To be able to describe and apply several well-known software testing techniques. To be able to compare testing techniques and present arguments relating to the most appropriate choice thereof.
Provisional Syllabus
Measurement: Representation and modelling, Scales, Structural Measures
Unit testing: Control Flowgraph Based testing including Data Flow based testing
Finding test cases using test data generation techniques. Coverage
Slicing and static analysis techniques
Industrial applications and industrial relevance of testing
Comparative software testing techniques
Aims
The aim of this module is to define, analyse and compare abstract models of computation and their associated programming paradigms.
Learning Outcomes
On successfully completing the module you should be able to demonstrate a deep knowledge and understanding of the fundamentals of formal languages and the principal models of computation and be able to work with theoretical/research-based knowledge at the forefront of the subject; judiciously apply and combine tools and techniques (frequently in novel ways) to solve a range of complex subject-specific problems with minimal direction; analyse subject material, draw inferences, and find relationships that demand that innovative thinking be engaged in and creativity be exhibited in formulating solutions; critically evaluate, exercise judgement, and compare and contrast relevant material with minimal guidance and to consider and argue for alternative, novel approaches; demonstrate a high degree of independence in managing your own learning and reflecting upon it in order to complete research tasks autonomously.
Provisional Syllabus
Introduction to abstract models of computation
Finite Automata, Push-Down Automata and applications to parsing
Turing machines
Functional calculi
Interaction-based systems
Concurrent computation
Aims
This module will cover different approaches for building internet applications and the choice of design techniques and technologies involved from a software engineering perspective, considering issues of efficiency, modularity and maintainability.
Learning Outcomes
You will gain the ability to design and implement internet-based applications in a modular manner, using appropriate languages and techniques. You will also gain the ability to specify and design medium-sized enterprise information systems using appropriate languages and techniques.
Provisional Syllabus
Model-driven architecture and application to internet applications
Client-side processing techniques: JavaScript, HTML
Server-side processing techniques: JSP, Servlets, database interfaces, sessions, connection pools
Modularity and maintainability of internet applications
Java EE architecture and patterns
Web services
Aims
This unit is devoted to algorithms processing strings and texts efficiently. These types of algorithms are used for software design in the domains of operating systems utilities, search engines on the Internet, data retrieval systems, analysis of genetic sequences, and natural language processing, for example.
Learning Outcomes
On completing the module, you should be able to design and implement exact and efficient algorithms for matching patterns in textual data, building indexes for files, and more generally for solving algorithmic problems on strings and sequences.
Provisional Syllabus
Basic concepts:
Periods in strings
Finite automata and regular expressions
Exact pattern matching:
Brute-force algorithms for pattern matching
The Knuth-Morris-Pratt algorithm
The Boyer-Moore algorithm
The Karp-Rabin algorithm
Horspool's algorithm
Multiple pattern matching:
The Aho-Corasick automaton
Two-dimensional pattern matching
Structures for indexes:
Suffix arrays
Suffix trees
Suffix automata
Regular Pattern Matching
From regular expression to automata
Simulation of deterministic automata
Aims
To provide an overall understanding of the communication model used on the Internet. To provide an in-depth understanding of the main underlying software components of the Internet. To provide an overview of the main languages used on the Internet. To provide an understanding of security threats to Internet application and the main technologies used to tackle them. To give you an understanding of the motivations behind internet technologies, suitable for you to evaluate current and future options.
Learning Outcomes
On successfully completing this module you will:
Development of Knowledge and Understanding
Have a comprehensive and detailed knowledge of the computational model underlying the Internet and recent developments in this area.
Know some of the languages used to display, represent, and manipulate information on the Internet.
Understand the security mechanisms used to protect Internet applications from unauthorised use.
Understand how protocols and languages combine to solve communication problems.
Be aware of the issues concerning privacy of personal information on the internet, and be able to apply techniques to protect privacy in any Internet applications you develop.
Cognitive/Intellectual Skills
Be able to analyse Internet-related problems using appropriate techniques and evaluating alternatives.
Be able to design solutions to such problems and evaluate the success of those solutions, possibly developing novel approaches.
Apply your knowledge of the Internet and its languages to these solutions.
Key/transferable skills
Know how to access and evaluate different sources of information regarding Internet standards, and technology standards more generally.
Have experience of solving technical, Internet-related, problems, and arguing for solutions to them.
Practical Skills
Be able to apply your knowledge of languages to meet appropriate software requirements.
Provisional Syllabus
Introduction to the Internet
Historical perspective and current context
Architecture of the Internet
Internet infrastructure
Addressing models
Web servers
Communication model
Internet reference model
TCP/IP
IPv4 and IPv6
Connection handling and flow control
HTTP and other application layer protocols
Resource location
Web languages fundamentals
HTML/XHTML
Form handling
XML
XML validation with schemas
Web service languages
Security on the Internet
Authentication methods
Digital certificates
Public and private key encryption
SSL
Introduction to Web models of information
Semantic Web
Grid computing
2:1 BSc honours degree or equivalent in computer science or related subject, eg mathematics, physics, chemistry, electrical engineering, or a joint degree in two such subjects. Competence in computer programming in a high level language such as Pascal, C, C++, Java etc, to the level expected at the end of the first year of a BSc honours degree in computer science. We may lower entry qualifications for students with substantial relevant work experience.
Your application will be reviewed by an admissions tutor and we aim to respond to applications within four to six weeks, although this may take longer during busy and holiday periods.
Please submit a one page personal statement with your application, explaining why you wish to apply for this programme and why you feel it matches your interests, academic background, and, if relevant, your career plans. Please include transcripts of subjects taken in the relevant degrees and copies of all certificates and relevant qualifications mentioned in your application.
King's provides a multi-cultural environment with the chance of meeting students from around the world. KCL also gave me the opportunity to network socially and make lifetime friends as well as getting involved in study groups. The libraries and other facilities are well equipped and staffed. Additionally, the campuses could not be better located for any student looking to experience London.
Due to the flexible nature of my course, I could work part time and study full time; this enabled me to fund my studies and gain industry experience while studying. King's has a high employment rate for its graduates because it prepares and equips students for the wider industry. I plan to look for jobs in firms with security concerns where I can apply the knowledge and skills I have gained. King's does not just provide materials for learning; it also provides the ideal environment for personal and professional growth and achievement.
Informatics is concerned with the study of the representation, storage, processing, and communication of information. It has many different aspects, including Computer Science, Artificial Intelligence, Robotics and Telecommunications. The Department of Informatics at King's seeks to address fundamental challenges and problems in these areas.
The MSc in Computing and Security is unique in that it balances the most topical issues in information assurance, computer and network security, cyber-forensics and cyber-crime with an equal mix of more traditional topics such as advanced algorithms and data structures.
I have been doing research and consultancy in many aspects of information security since 1996, much of it in collaboration with the Department of War Studies at King's, the Computer Forensics Research Group at the University of Hong Kong, the UK Ministry of Defence, and BAe Systems.
I am currently doing research in cyber-warfare, digital forensics, the analysis and interpretation of cyber-crime statistics, denial of service detection and mitigation, and malware detection.
Due to the exponential rise in information security breaches and the urgent need to develop increasingly effective cyber defences for government, industry and commerce, there is an almost inexhaustible demand for well qualified and competent post-graduates from the information security industry.