4 research outputs found

    On bent and hyper-bent functions

    Get PDF
    Bent functions are Boolean functions which have maximum possible nonlinearity i.e. maximal distance to the set of affine functions. They were introduced by Rothaus in 1976. In the last two decades, they have been studied widely due to their interesting combinatorial properties and their applications in cryptography. However the complete classification of bent functions has not been achieved yet. In 2001 Youssef and Gong introduced a subclass of bent functions which they called hyper-bent functions. The construction of hyper-bent functions is generally more difficult than the construction of bent functions. In this thesis we give a survey of recent constructions of infinite classes of bent and hyper-bent functions where the classification is obtained through the use of Kloosterman and cubic sums and Dickson polynomials

    Design and Analysis of Symmetric Primitives

    Get PDF
    corecore