In this dissertation, we investigate the ways in which search techniques, and in particular metaheuristic search techniques, can be used in cryptology. We address the design of simple cryptographic components (Boolean functions), before moving on to more complex entities (S-boxes). The emphasis then shifts from the construction of cryptographic artefacts to the related area of cryptanalysis, in which we first derive non-linear approximations to S-boxes more powerful than the existing linear approximations, and then exploit these in cryptanalytic attacks against the ciphers DES and Serpent.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:568119 |
| Date | January 2012 |
| Creators | McLaughlin, James |
| Contributors | Clark, John |
| Publisher | University of York |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://etheses.whiterose.ac.uk/3674/ |
Page generated in 0.0018 seconds