This paper proposes two efficient residue to binary converters on a new three-moduli set using the Chinese Remainder Theorem. The proposed reverse converters are adder based and memoryless. In comparison with other moduli sets with similar dynamic range, the new schemes out-perform the existing schemes in terms of both hardware cost and relative performance.

Information security is a critical issue in data communication networks. This is more important in wireless communications due to the fact that the transmitted signal could go beyond the communicating participants. Any person with the right equipment could intercept the transmitted information with ease. It is therefore paramount to encrypt information before transmission to prevent intruders from making meaning to intercepted signals. In this paper, an improved Rivest Shamir Adleman (RSA) cryptosystem based on Residue Number System (RNS) is implemented. There are two stages of encryption. The first stage is the traditional RSA and the second stage is to further encrypt the cypher text obtained from RSA using smaller moduli. The first stage of the decryption process is to obtain a partial result through Mixed Radix Conversion (MRC). The final stage of decryption is the RSA decryption process. This is to allow a message m, for which m e < n to be able to be encrypted. The private key length is also enhanced by adding the moduli set to the RSA private key component. It is observed that the proposed system outperforms the existing algorithm in terms of security.

Sensitive information is transmitted across the internet every day and keeping such information as sacred is an important adventure. This is because malicious activities are on the increase as hackers are doing everything possible to steal such information. In this paper, we have implemented a new Rivest Shamir Adleman (RSA) encryption scheme based on the Chinese Remainder Theorem (CRT). The scheme consists of two level of encryption and two level of decryption. The first level of encryption is the classical RSA encryption and in the second level of encryption, we used forward conversion technique in Residue Number System. In the first level of decryption, we employed the CRT and the classical RSA decryption process is used for the second level of decryption. This new scheme will ensure that smaller messages, m for which c=m e

Originated envisaged for military functions, Wireless Sensor Networks (WSN) have gain wide-ranging applicability including in home, business, agriculture, environment monitoring, health care and structural engineering. Despite the immeasurable benefits, Wireless Sensor Networks have inherent constraints arising mainly from its low battery powered sensor nodes. Many design efforts have focused on designing energy efficient means of monitory and transmitting required application specific events as long as required. Different energy-efficient schemes have been developed in past studies to varying successes. This paper reviews some relevant literature on existing routing protocols for wireless sensor network with much emphasis given to the Low Adaptive Clustering Hierarchy (LEACH) protocol, its variant protocols as well as its security-enabled versions.

This paper proposes an efficient residue to binary converter on a new three-moduli set (2 2 +1 , 2 2 +1 − 1, 2 − 1) using the Mixed Radix Conversion. The proposed reverse converters are adder based and memoryless. In comparison with other moduli sets with similar dynamic range, the new schemes out-perform the existing schemes in terms of both hardware cost and propagation delay.

In this paper, an enhanced Riveset Shamir Adleman (RSA) encryption scheme with data compression features based on Residue Number Systems (RNS) has been proposed and implemented. This scheme is implemented using the moduli set,. The scheme has two level of encryption and a two level of decryption to form a double layer public key encryption scheme. The first level comprises the classical RSA encryption algorithm and in the second layer, RNS number representation is utilised. Mixed Radix Conversion is employed in the first level of decryption and in the second level; the classical RSA decryption process is used. This will ensure a secured data transmission of messages of varying lengths. The private key length is further enhanced as the moduli set are part of the private key for decryption processes. The residues which form the basis of the transmitted cipher text are smaller in terms of number of bits than the cipher text generated from the classical RSA encryption scheme. This will increase the rate of data transmission in the communication channel.

No abstract

No abstract