scholarly journals A Novel Text Encryption and Decryption Scheme using the Genetic Algorithm and Residual Numbers

10.29007/zd9h ◽  
2019 ◽  
Author(s):  
Peter Awon-Natemi Agbedemnab ◽  
Edward Yellakuor Baagyere ◽  
Mohammed Ibrahim Daabo
Keyword(s):  
Genetic Algorithm ◽  
Data Security ◽  
Number System ◽  
Residue Number System ◽  
The Other ◽  
Throughput Rate ◽  
Key Space ◽  
Encryption And Decryption ◽  
Residue Number

Data Security is a major concern for both individuals and organisations that are engaged in one form of communication or the other, especially in the cyberspace as a result of the emergence of digital computing and communication. In this paper, we present a novel three-layered text encryption and decryption scheme that is capable of encrypting and decrypting any character or symbol using Genetic Algorithm (GA) and some inherent properties from the Residue Number System (RNS). Simulated results of the proposed scheme shows that it is chaotic by sense of sight, robust with a very wide key space composed at different stages of the scheme and has a good throughput rate as well as being able to encrypt both smaller and larger messages.

scholarly journals Revisiting Sum of Residues Modular Multiplication

2010 ◽  
Vol 2010 ◽  
pp. 1-9 ◽  
Author(s):  
Yinan Kong ◽  
Braden Phillips
Keyword(s):  
Public Key Cryptography ◽  
Number System ◽  
Residue Number System ◽  
The Other ◽  
Public Key ◽  
Modular Multiplication ◽  
Residue Number ◽  
The Cost

In the 1980s, when the introduction of public key cryptography spurred interest in modular multiplication, many implementations performed modular multiplication using a sum of residues. As the field matured, sum of residues modular multiplication lost favor to the extent that all recent surveys have either overlooked it or incorporated it within a larger class of reduction algorithms. In this paper, we present a new taxonomy of modular multiplication algorithms. We include sum of residues as one of four classes and argue why it should be considered different to the other, now more common, algorithms. We then apply techniques developed for other algorithms to reinvigorate sum of residues modular multiplication. We compare FPGA implementations of modular multiplication up to 24 bits wide. The sum of residues multipliers demonstrate reduced latency at nearly 50% compared to Montgomery architectures at the cost of nearly doubled circuit area. The new multipliers are useful for systems based on the Residue Number System (RNS).

scholarly journals Binary to RNS encoder for the moduli set {2n-1, 2n, 2n+1} with embedded diminished-1 channel for DSP application

2016 ◽  
Vol 29 (1) ◽  
pp. 101-112
Author(s):  
Ivan Krstic ◽  
Negovan Stamenkovic ◽  
Vidosav Stojanovic
Keyword(s):  
Dynamic Range ◽  
Digital Signal ◽  
Number System ◽  
Residue Number System ◽  
The Other ◽  
Minimal Amount ◽  
Residue Number ◽  
Fpga Chip ◽  
The One ◽  
Xilinx Fpga

A binary-to-residues encoder (forward encoder) is an essential building block for the residue number system digital signal processing (RNS DSP) and as such it should be built with a minimal amount of hardware and be efficient in terms of speed and power. The main parts of the forward encoder are residue generators which are usually classified into two categories: the one based on arbitrary moduli-set which make use of look-up tables, and the other based on the special moduli sets. A new memory less architecture of binary-to-RNS encoder based on the special moduli set {2n?1,2n,2n+1} with embedded modulo 2n+1 channel in the diminished-1 representation is presented. Any of two channels (standard modulo 2n +1, or modulo 2n+1 in the diminished-1 representation) operation can be performed by using a single switch. The proposed encoder has been implemented on a Xilinx FPGA chip for the various dynamic range requirements.

scholarly journals Robust and Fragile Medical Image Watermarking: A Joint Venture of Coding and Chaos Theories

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Atta Ur Rahman ◽  
Kiran Sultan ◽  
Dhiaa Musleh ◽  
Nahier Aldhafferi ◽  
Abdullah Alqahtani ◽  
...  
Keyword(s):  
Medical Image ◽  
Joint Venture ◽  
State Of The Art ◽  
Image Watermarking ◽  
Region Of Interest ◽  
Number System ◽  
Residue Number System ◽  
The Other ◽  
Residue Number ◽  
Hybrid Watermarking

A secure spatial domain, hybrid watermarking technique for obtaining watermark (authentication information) robustness and fragility of the host medical image (content integrity) using product codes, chaos theory, and residue number system (RNS) is proposed. The proposed scheme is highly fragile and unrecoverable in terms of the host image, but it is significantly robust and recoverable in terms of the watermark. Altering the medical image may result in misdiagnosis, hence the watermark that may contain patient information and organization logo must be protected against certain attacks. The host medical image is separated into two parts, namely, the region of interest (ROI) and region of noninterest (RONI) using a rectangular region. The RONI part is used to embed the watermark information. Moreover, two watermarks are used: one to achieve authenticity of image and the other to achieve the robustness against both incidental and malicious attacks. Effectiveness in terms of security, robustness, and fragility of the proposed scheme is demonstrated by the simulations and comparison with the other state-of-the-art techniques.

scholarly journals Diminished-1 multiplier using modulo adder

2018 ◽  
Vol 7 (4.20) ◽  
pp. 31
Author(s):  
Beerendra Kumar Patel ◽  
Jitendra Kanung
Keyword(s):  
Data Security ◽  
Number System ◽  
Residue Number System ◽  
Number Representation ◽  
Ripple Carry Adder ◽  
Computational Speed ◽  
Residue Number ◽  
Product Generation ◽  
Significant Area ◽  
Basic Blocks

In this work Modulo multiplier offers higher computational speed than a normal multiplier. It is frequently used in data security and residue number system. The modulo 122n+1">   has three basic blocks-partial product generation block, inverted end around carry adder tree block and diminished-1 modulo 122n+1">   adder block. The result and an operand use weighted representation and others uses the diminished-1 for the modulo multiplier. The multipliers receive full inputs and avoid (n+1) bits circuits due to diminished-1 number representation. In this work, proposed modulo 122n+1">  multiplier with modified diminished-1 modulo 122n+1">   adder which is based on ripple carry adder. The proposed design saves significant area and power as compared to the reported one with little increment in delay.  

scholarly journals Montgomery reduction within the context of residue number system arithmetic

2017 ◽  
Vol 8 (3) ◽  
pp. 189-200 ◽  
Author(s):  
Jean-Claude Bajard ◽  
Julien Eynard ◽  
Nabil Merkiche
Keyword(s):  
Number System ◽  
Residue Number System ◽  
Residue Number ◽  
Montgomery Reduction

scholarly journals Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System

2021 ◽  
Author(s):  
Mikhail Selianinau
Keyword(s):  
Chinese Remainder Theorem ◽  
Number System ◽  
Residue Number System ◽  
Computer Applications ◽  
Efficient Approach ◽  
Residue Modulo ◽  
Modern Computer ◽  
New Variant ◽  
Residue Number ◽  
Residue Code

AbstractIn this paper, we deal with the critical problem of performing non-modular operations in the Residue Number System (RNS). The Chinese Remainder Theorem (CRT) is widely used in many modern computer applications. Throughout the article, an efficient approach for implementing the CRT algorithm is described. The structure of the rank of an RNS number, a principal positional characteristic of the residue code, is investigated. It is shown that the rank of a number can be represented by a sum of an inexact rank and a two-valued correction to it. We propose a new variant of minimally redundant RNS, which provides low computational complexity for the rank calculation, and its effectiveness analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the excess residue modulo 2, the complexity of the rank calculation goes down from $O\left (k^{2}\right )$ O k 2 to $O\left (k\right )$ O k with respect to required modular addition operations and lookup tables, where k equals the number of non-redundant RNS moduli.

Sign in / Sign up

Export Citation Format

Share Document