Image encryption and decryption in RNS domain based on {2n, 22n+1-1, 2n+1, 2n-1} moduli set

Abstract
In this brief, the implementation of efficient image encryption and decryption scheme in Residue Number System (RNS) is analyzed. The RNS domain is mainly chosen for its carry free parallel and fast arithmetic operations. But, the converters make RNS inefficient by having large delays. Hence, to use the RNS for our applications we must have the efficient converters. Here, we designed pure combinational logic based forward and reverse converters without using any preloaded ROM's. We used most efficient moduli set {2 n ,2 2n+1 -1,2 n +1,2 n -1} for realizing these converters. New Chinese Reminder theorem-II is used for the implementation of reverse converter. The image is encrypted by doing modular conversion using forward converted and the original image is decrypted using reverse converter.

This publication has 9 references indexed in Scilit: