[Resource Topic] 2018/591: 4-bit crypto S-boxes: Generation with irreducible polynomials over Galois field GF(24) and cryptanalysis

Welcome to the resource topic for 2018/591

Title:
4-bit crypto S-boxes: Generation with irreducible polynomials over Galois field GF(24) and cryptanalysis.

Authors: Sankhanil Dey, Ranjan Ghosh

Abstract:

4-bit crypto S-boxes play a significant role in encryption and decryption of many cipher algorithms from last 4 decades. Generation and cryptanalysis of generated 4-bit crypto S-boxes is one of the major concerns of modern cryptography till now. In this paper 48, 4-bit crypto S-boxes are generated with addition of all possible additive constants to the each element of crypto S-box of corresponding multiplicative inverses of all elemental polynomials (EPs) under the concerned irreducible polynomials (IPs) over Galois field GF(2^4). Cryptanalysis of 48 generated 4-bit crypto S-boxes is done with all relevant cryptanalysis algorithms of 4-bit crypto S-boxes. The result shows the better security of generated 4-bit crypto S-boxes.

ePrint: https://eprint.iacr.org/2018/591

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .