Enhancing Image Security during Transmission using Residue Number System and k-shuffle

Alhassan, Issah Zabsonre; Ansong, Edward Danso; Abdul-Salaam, Gaddafi; Alhassan, Salamudeen

doi:10.34198/ejms.4220.399424

Cited by 4 publications

(3 citation statements)

References 27 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mean-squared error (MSE), peak signal-tonoise ratio (PSNR), and correlation are also used to compare the original and modified images. The MSE between two images g ( x , y ) and ĝ ( x , y ) is expressed in (6). The scale of the pictures is MN.…”

Section: Methodsmentioning

confidence: 99%

Enhanced image security using residue number system and new Arnold transform

Babatunde

Oke

Oloyede

et al. 2021

J. Teknol. dan Sist. Komput

View full text Add to dashboard Cite

This paper aims to improve the image scrambling and encryption effect in traditional two-dimensional discrete Arnold transform by introducing a new Residue number system (RNS) with three moduli and the New Arnold Transform. The study focuses on improving the classical discrete Arnold transform with quasi-affine properties, applying image scrambling and encryption research. The design of the method is explicit to three moduli set {2n, 2n+1+1, 2n+1-1}. These moduli set includes equalized and shapely moduli leading to the effective execution of the residue to binary converter. The study employs an arithmetic residue to the binary converter and an improved Arnold transformation algorithm. The encryption process uses MATLAB to accept a digital image input and subsequently convert the image into an RNS representation. The images are connected as a group. The resulting encrypted image uses the Arnold transformation algorithm. The encrypted image is used as input at decryption using the anti-Arnold (Reverse Arnold) transformation algorithm to convert the picture to the original RNS (original pixel value). Then the RNS was used to retransform the original RNS to its binary form. Security analysis tests, like histogram analysis, keyspace, key sensitivity, and correlation coefficient analysis, were administered on the encrypted image. Results show that the hybrid system can use the improved Arnold transform algorithm with better security and no constraint on image width and size.

show abstract

Section: Methodsmentioning

confidence: 99%

Enhanced image security using residue number system and new Arnold transform

Babatunde

Oke

Oloyede

et al. 2021

J. Teknol. dan Sist. Komput

View full text Add to dashboard Cite

show abstract

“…2 illustrates a perfect 2-shuffle of 14 bit-string. Aside card shuffling, K-Shuffle have found usage in encryption [10] - [13] to protect data.…”

Section: The K-shuffle Techniquementioning

confidence: 99%

Twin K-Shuffle Based Audio Steganography

Salamudeen

Daabo²,

Armah³

2022

AJEAT

View full text Add to dashboard Cite

Secure communication is most effective when it is covert. In the realm of covert communication, steganography conceals secret message within a cover medium. This ensures that adversaries who have access to this carrier medium are unaware of the existence of the secret message. This paper proposes a novel twin K-Shuffling and embedding technique that scrambles and hides secret message inside audio samples. The scrambling phase of the proposed technique consists of bit and character shuffling. The bit-shuffling scrambles the bit-string of each character in the secret message into cipher-text via K-Shuffle. The characters of the resulting cipher-text are then shuffled by another K-Shuffle technique to yield chaotic cipher-text. At the embedding phase, the scrambled cipher-text is randomly planted into the carrier audio samples. The novelty in this proposed technique is the provision of a three-layer protection for secret messages; bit, character, and encoding layers. Results and analyses show that this technique satisfied both embedding and encryption requirements of steganographic systems.

show abstract

“…If the moduli are pair-wise prime, dynamic range M is maximized (i.e., M = Π k i=1 m i ). In RNS, operations like addition, subtraction, and multiplication are performed in k parallel independent channels, which makes it a promising candidate for applications that use frequent add/multiply operations such as finite impulse response digital filters [4], data transmission [1], cryptography [18], and image processing [28]. Furthermore, digital signal processing (DSP) has employed RNS due to such properties as carry-free operations, parallelism, and modularity [2].…”

Section: Introductionmentioning

confidence: 99%

Sign Detection and Signed Integer Comparison for the 3-Moduli Set {2^n±1,2^(n+k)}

Torabi

Timarchi²

2021

csci

View full text Add to dashboard Cite

Comparison, division and sign detection are considered complicated operations in residue number system (RNS). A straightforward solution is to convert RNS numbers into binary formats and then perform complicated operations using conventional binary operators. If efficient circuits are provided for comparison, division and sign detection, the application of RNS can be extended to the cases including these operations.For RNS comparison in the 3-moduli set , we have only found one hardware realization. In this paper, an efficient RNS comparator is proposed for the moduli set which employs sign detection method and operates more efficient than its counterparts. The proposed sign detector and comparator utilize dynamic range partitioning (DRP), which has been recently presented for unsigned RNS comparison. Delay and cost of the proposed comparator are lower than the previous works and makes it appropriate for RNS applications with limited delay and cost.

show abstract

Enhancing Image Security during Transmission using Residue Number System and k-shuffle

Cited by 4 publications

References 27 publications

Enhanced image security using residue number system and new Arnold transform

Enhanced image security using residue number system and new Arnold transform

Twin K-Shuffle Based Audio Steganography

Sign Detection and Signed Integer Comparison for the 3-Moduli Set {2^n±1,2^(n+k)}

Contact Info

Product

Resources

About