Threshold implementations of Small S-boxes

Begül Bilgin, S.I. Nikova, Ventzislav Nikov, Vincent Rijmen, Natalia Tokareva, Valeriya Vitkup

    Research output: Contribution to journalArticleAcademicpeer-review

    25 Citations (Scopus)

    Abstract

    Threshold implementation (TI) is a masking method that provides security against first-order DPA with minimal assumptions on the hardware. It is based on multi-party computation and secret sharing. In this paper, we provide an efficient technique to find TIs for all 3 and 4-bit permutations which also covers the set of 3×3 and 4×4 invertible S-boxes. We also discuss alternative methods to construct shared functions by changing the number of variables or shares. Moreover, we further consider the TI of 5-bit almost bent and 6-bit almost perfect nonlinear permutations. Finally, we compare the areas of these various TIs.
    Original languageUndefined
    Pages (from-to)3-33
    Number of pages32
    JournalCryptography and communications
    Volume7
    Issue number1
    DOIs
    Publication statusPublished - Mar 2015

    Keywords

    • EWI-25076
    • IR-91874
    • METIS-306032
    • SCS-Cybersecurity

    Cite this

    Bilgin, B., Nikova, S. I., Nikov, V., Rijmen, V., Tokareva, N., & Vitkup, V. (2015). Threshold implementations of Small S-boxes. Cryptography and communications, 7(1), 3-33. https://doi.org/10.1007/s12095-014-0104-7
    Bilgin, Begül ; Nikova, S.I. ; Nikov, Ventzislav ; Rijmen, Vincent ; Tokareva, Natalia ; Vitkup, Valeriya. / Threshold implementations of Small S-boxes. In: Cryptography and communications. 2015 ; Vol. 7, No. 1. pp. 3-33.
    @article{84ed160fe8ac48908676cbf7e71e8e75,
    title = "Threshold implementations of Small S-boxes",
    abstract = "Threshold implementation (TI) is a masking method that provides security against first-order DPA with minimal assumptions on the hardware. It is based on multi-party computation and secret sharing. In this paper, we provide an efficient technique to find TIs for all 3 and 4-bit permutations which also covers the set of 3×3 and 4×4 invertible S-boxes. We also discuss alternative methods to construct shared functions by changing the number of variables or shares. Moreover, we further consider the TI of 5-bit almost bent and 6-bit almost perfect nonlinear permutations. Finally, we compare the areas of these various TIs.",
    keywords = "EWI-25076, IR-91874, METIS-306032, SCS-Cybersecurity",
    author = "Beg{\"u}l Bilgin and S.I. Nikova and Ventzislav Nikov and Vincent Rijmen and Natalia Tokareva and Valeriya Vitkup",
    note = "eemcs-eprint-25076",
    year = "2015",
    month = "3",
    doi = "10.1007/s12095-014-0104-7",
    language = "Undefined",
    volume = "7",
    pages = "3--33",
    journal = "Cryptography and communications",
    issn = "1936-2447",
    publisher = "Springer",
    number = "1",

    }

    Bilgin, B, Nikova, SI, Nikov, V, Rijmen, V, Tokareva, N & Vitkup, V 2015, 'Threshold implementations of Small S-boxes', Cryptography and communications, vol. 7, no. 1, pp. 3-33. https://doi.org/10.1007/s12095-014-0104-7

    Threshold implementations of Small S-boxes. / Bilgin, Begül; Nikova, S.I.; Nikov, Ventzislav; Rijmen, Vincent; Tokareva, Natalia; Vitkup, Valeriya.

    In: Cryptography and communications, Vol. 7, No. 1, 03.2015, p. 3-33.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Threshold implementations of Small S-boxes

    AU - Bilgin, Begül

    AU - Nikova, S.I.

    AU - Nikov, Ventzislav

    AU - Rijmen, Vincent

    AU - Tokareva, Natalia

    AU - Vitkup, Valeriya

    N1 - eemcs-eprint-25076

    PY - 2015/3

    Y1 - 2015/3

    N2 - Threshold implementation (TI) is a masking method that provides security against first-order DPA with minimal assumptions on the hardware. It is based on multi-party computation and secret sharing. In this paper, we provide an efficient technique to find TIs for all 3 and 4-bit permutations which also covers the set of 3×3 and 4×4 invertible S-boxes. We also discuss alternative methods to construct shared functions by changing the number of variables or shares. Moreover, we further consider the TI of 5-bit almost bent and 6-bit almost perfect nonlinear permutations. Finally, we compare the areas of these various TIs.

    AB - Threshold implementation (TI) is a masking method that provides security against first-order DPA with minimal assumptions on the hardware. It is based on multi-party computation and secret sharing. In this paper, we provide an efficient technique to find TIs for all 3 and 4-bit permutations which also covers the set of 3×3 and 4×4 invertible S-boxes. We also discuss alternative methods to construct shared functions by changing the number of variables or shares. Moreover, we further consider the TI of 5-bit almost bent and 6-bit almost perfect nonlinear permutations. Finally, we compare the areas of these various TIs.

    KW - EWI-25076

    KW - IR-91874

    KW - METIS-306032

    KW - SCS-Cybersecurity

    U2 - 10.1007/s12095-014-0104-7

    DO - 10.1007/s12095-014-0104-7

    M3 - Article

    VL - 7

    SP - 3

    EP - 33

    JO - Cryptography and communications

    JF - Cryptography and communications

    SN - 1936-2447

    IS - 1

    ER -

    Bilgin B, Nikova SI, Nikov V, Rijmen V, Tokareva N, Vitkup V. Threshold implementations of Small S-boxes. Cryptography and communications. 2015 Mar;7(1):3-33. https://doi.org/10.1007/s12095-014-0104-7