Enhancing image data security with chain and non-chain Galois ring structures

Muhammad Umair Safdar, Tariq Shah and Asif Ali

Mathematics and Computers in Simulation (MATCOM), 2024, vol. 225, issue C, 659-694

Abstract: The local ring-based cryptosystem is built upon the core mathematical operations of the algebraic structure of local rings, which provides a significant advantage in ensuring security against advanced cryptanalysis. However, using the entire set of units within this structure would be computationally impractical in practical applications. Thus, we present a novel approach for designing 16×16 and 32×32 substitution boxes over chain and non-chain Galois ring respectively, by utilizing subgroups of local rings in a computationally feasible manner. Our proposed scheme significantly reduces memory usage by integrating both chain and non-chain rings. Specifically, the 16×16 and 32×32 S-boxes require only 16×28and 32×28 memory cells, respectively, whereas S-boxes of these dimensions over fields have been shown to be highly inefficient due to their extensive memory requirements (16×216and 32×232,respectively). The proposed method offers a more efficient solution for constructing S-boxes over large Galois fields and integrates chain and non-chain local Galois rings, as well as finite fields, for efficient transmission designs in smart devices. The algebraic structures used in this approach are used to establish the most vital aspect of a block cipher, the substitution box. We use each of these algebraic structures, each with a different bit size, to construct three distinct S-boxes. We discuss the performance and sensitivity of the proposed S-boxes to demonstrate their effectiveness in data protection. In this technique, the substitution boxes established by the non-chain ring, maximal cyclic subgroup of the Galois ring, and Galois field are applied for the processes of substitution, exclusive-or function, and diffusion in image encryption, respectively. Furthermore, we have performed numerous standard analyses on the encrypted image, including statistical analysis, differential analysis, and NIST tests. The results of these tests demonstrate the effectiveness of the proposed approach for various cryptographic purposes. Overall, this work provides a valuable contribution to the field of cryptography, particularly in constructing efficient S-boxes over large Galois fields.

Keywords: Galois ring; Non-chain ring; Substitution box; SP Network; Image Encryption (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475424002192
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:225:y:2024:i:c:p:659-694

DOI: 10.1016/j.matcom.2024.06.008

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().