5 research outputs found

    The kth-order nonhomomorphicity of S-boxes

    Get PDF
    Nonhomomorphicity is a new nonlinearity criterion of a mapping or S-box used in a private key encryption algorithm. An important advantage of nonhomomorphicity over other nonlinearity criteria is that the value of nonhomomorphicity is easy to estimate by the use of a fast statistical method. Due to the Law of Large Numbers, such a statistical method is highly reliable. Major contributions of this paper are (1) to explicitly express the nonhomomorphicity by other nonlinear characteristics, (2) to identify tight upper and lower bounds on nonhomomorphicity, and (3) to find the mean of nonhomomorphicity over all the S-boxes with the same size. It is hoped that these results on nonhomomorphicity facilitate the analysis and design of S-boxes

    Ongoing Research Areas in Symmetric Cryptography

    Get PDF
    This report is a deliverable for the ECRYPT European network of excellence in cryptology. It gives a brief summary of some of the research trends in symmetric cryptography at the time of writing. The following aspects of symmetric cryptography are investigated in this report: • the status of work with regards to different types of symmetric algorithms, including block ciphers, stream ciphers, hash functions and MAC algorithms (Section 1); • the recently proposed algebraic attacks on symmetric primitives (Section 2); • the design criteria for symmetric ciphers (Section 3); • the provable properties of symmetric primitives (Section 4); • the major industrial needs in the area of symmetric cryptography (Section 5)

    D.STVL.9 - Ongoing Research Areas in Symmetric Cryptography

    Get PDF
    This report gives a brief summary of some of the research trends in symmetric cryptography at the time of writing (2008). The following aspects of symmetric cryptography are investigated in this report: • the status of work with regards to different types of symmetric algorithms, including block ciphers, stream ciphers, hash functions and MAC algorithms (Section 1); • the algebraic attacks on symmetric primitives (Section 2); • the design criteria for symmetric ciphers (Section 3); • the provable properties of symmetric primitives (Section 4); • the major industrial needs in the area of symmetric cryptography (Section 5)

    The kth Order Nonhomomorphicity of S-Boxes

    No full text
    this paper we resolve the problem by presenting a set of results on ~
    corecore