Boolean functions are used as components in the design of many symmetric ciphers (for example S-boxes for block ciphers like AES, or the non-linear component of stream ciphers). These functions have to satisfy certain properties in order to resist known cryptographic attacks. In this project we consider a family of such properties, called PN (Perfect non-linear), APN (almost perfect non-linear) and GAPN (generalised APN). There are some well-known functions with these properties, but recently new methods of constructing such functions have been proposed, involving a combination of theoretical results and computer search. We aim to further develop these methods and obtain new such functions.
Entry requirements part one:
Applicants should have, or expect to achieve, at least a 2:1 Honours degree (or equivalent) in Computer Science or Mathematics.
Entry requirements part two:
All students must also meet the minimum English Language requirements (Link opens in a new window) A relevant Master's degree and / or experience in one or more of the following will be an advantage: network security, mathematics, theoretical computer science.
How to apply
All applications should be made online. Under programme name, select ‘Computer Science’. Please quote reference CO/AM-Un1/2019.
Programme name (to be included on the application form): Computer Science