• Computational investigation of 0-APN monomials 

      Nesheim, Kjetil Amundsen (Master thesis, 2022-05-18)
      This thesis is dedicated to exploring methods for deciding whether a power function $F(x) = x^d$ is 0-APN. Any APN function is 0-APN, and so 0-APN-ness is a necessary condition for APN-ness. APN functions are cryptographically ...
    • Computational searches for quadratic APN functions with subfield coefficients 

      Berg, Simon Knotten (Master thesis, 2023-06-01)
      Almost perfect nonlinear (APN) functions are important in fields such as algebra, combinatorics, cryptography, etc. Finding new APN functions is of special importance in cryptography. This is because when used in modern ...
    • Thickness Distribution of Boolean Functions in 4 and 5 Variables 

      Hopp, Mathias Ludvig Presterud (Master thesis, 2020-05-12)
      This thesis explores the distribution of algebraic thickness of Boolean functions in four and five variables, that is, the minimum number of terms in the ANF of the functions in the orbit of a Boolean function, through all ...