RSA Based Encryption and Decryption of Any Text with the Help of XOR Operation and Color Mapping Technique

2019 ◽  
pp. 545-552 ◽  
Author(s):  
Madhusmita Sahu
Keyword(s):  
Mapping Technique ◽  
Color Mapping ◽  
Xor Operation ◽  
Encryption And Decryption

scholarly journals Noise Assisted Image Encryption and Decryption using 2-D Chaotic System

2021 ◽  
Author(s):  
Namrata Biswas ◽  
I. Raja Mohamed
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Color Image ◽  
Image Transmission ◽  
Noise Signal ◽  
State Variables ◽  
Initial Values ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Information Image

Abstract In this paper, a new two-dimensional (2-D) chaos-based color image encryption and decryption scheme is proposed in which the noise signal is selected randomly to set the initial values for a chaotic system which also enhances the security of the system. The 256-bit hash value of noise is transformed into one-time initial values for the state variables of this proposed chaotic system. XOR operation is further carried out to diffuse the pixels. Finally, statistical and security analyses are performed for understanding the effectiveness of the proposed system. Experimental results confirm that the proposed chaos-based cryptosystem is efficient and suitable for information (image) transmission in a highly secured way.

scholarly journals Analysis of power reduction and implementation on FPGA for AES-128bits using BEDT schemes

2017 ◽  
Vol 7 (1.5) ◽  
pp. 126
Author(s):  
C. Sapna Kumari ◽  
K. V. Prasad
Keyword(s):  
Research Work ◽  
Cross Coupling ◽  
Power Reduction ◽  
Energy Utilization ◽  
Rapid Improvement ◽  
Coupling Capacitance ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Encoding Strategy ◽  
Communications System

Due to rapid improvement for innovations in cryptography, the scattered of power link in connections of cryptography contexts instigates to resist through the power disseminated via substitute mechanisms of the communication subsystem, the switches and the sub modules of cutting edge encryption standard (AES). The dynamic power dissemination in joins is real supporter of the power utilization in organize on the chip. Due to self-exchanging and cross coupling capacitance the power consumption is shirking in communications system for security aspects. In the present research work the encoding strategy the key self-exchanging is diminish by examination the exchanging change and afterward the link between the connections is patterned and guaranteed that the power utilization is lessened. To upgrade control utilization in encryption and decoding process, Bit Encryption and Decryption Transition (BEDT) information schemes went for lessening the power disseminated by the AES chiefly include round key module in AES to perform XOR operation between 128 bits plain content and secrete key. The suggested research work in this paper is main basic concept of AES due to its number of round operations and also it will allow 39% of energy sprinkling and 9% of energy utilization without having more number execution debasement and with below 11% range overhead in the other cryptography frameworks. The proposed BEDT schemes depends on both odd modified and even rearranged, and after that sending the information to receiver that will performed utilizing the kind off reversal which lessens increasingly the exchanging movement. In these proposed three schemes, utilizes an easier decoder while accomplishing a higher movement diminishment. In the prior schemes, the quantity of changes from 0 to 1 for two back to back flutters is tallied. The bit transitions reduce the number of transitions before transmitting the data to decryption.

scholarly journals Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography

2012 ◽  
pp. 111-117
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Manas Kumar Swain
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
A Cell ◽  
Updating Rule ◽  
Fundamental Objective

Cellular Automaton is an idealized parallel processing machine which is an array (1-D, 2-D) of numbers or symbols called cell values together with an updating rule. A cell value is updated based on this updating rule, which involves the cell value as well as other cell values in a particular neighborhood. A fundamental objective of cryptography is to enable two people to communicate over an insecure channel (a public channel such as internet) in such a way that any other person is unable to recover their message (called the plaintext) from what is sent in its place over the channel (the cipher text). The transformation of the plaintext into the cipher text is called encryption, or enciphering. The transformation of the cipher text into the plaintext is called decryption, or deciphering. In this paper we present a new encryption and decryption algorithm based on the linear (periodic boundary-PB) and nonlinear Cellular Automata rules. First we apply PB CA rules to plain text and key. The result of both plain text and key is XORed. Then the result of XOR operation is fed to substitution box( S-box) and again PB CA rules are applied for exchange and shift operations. At the end Complement operation is applied for encryption of plain text. The decryption process is carried out just similar to encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 numbers of rounds in order to avoid the dependency between the plain text and cipher text.

scholarly journals Encryption and Decryption algorithm using two dimensional cellular automata rules in Cryptography

2011 ◽  
pp. 18-23
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Umesh Prasad Rout ◽  
Surendra Kumar Nanda
Keyword(s):  
Cellular Automata ◽  
Periodic Boundary ◽  
Block Cipher ◽  
Two Dimensional ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Non Linear

In this paper we present a new encryption and decryption algorithm for block cipher based on the linear (periodic boundary-PB) and nonlinear cellular automata rules. First we apply non linear CA rules (complements) to both plain text and key. Then PB CA rule is applied to the above results separately followed by the XOR operation of above results. After that the result of XOR operation is fed to substitution box(S-box) and again PB CA rules are applied followed by SBox. The decryption process is carried out just similar to that of encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 number of rounds in order to avoid the dependency between the plain text and cipher text so that the our proposed algorithm is more secure than that of AES and DES algorithms.

scholarly journals ESSM: Formal Analysis Framework for Protocol to Support Algebraic Operations and More Attack Capabilities

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Xuyang Miao ◽  
Chunxiang Gu ◽  
Siqi Lu ◽  
Yanan Shi
Keyword(s):  
Formal Method ◽  
Formal Analysis ◽  
Analysis Tool ◽  
Analysis Framework ◽  
Cryptographic Primitives ◽  
Space Model ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Algebraic Operations ◽  
Key Compromise Impersonation

The strand space model has been proposed as a formal method for verifying the security goals of cryptographic protocols. However, only encryption and decryption operations and hash functions are currently supported for the semantics of cryptographic primitives. Therefore, we establish the extended strand space model (ESSM) framework to describe algebraic operations and advanced threat models. Based on the ESSM, we add algebraic semantics, including the Abelian group and the XOR operation, and a threat model based on algebraic attacks, key-compromise impersonation attacks, and guess attacks. We implement our model using the automatic analysis tool, Scyther. We demonstrate the effectiveness of our framework by analysing several protocols, in particular a three-factor agreement protocol, with which we can identify new attacks while providing trace proofs.

Sign in / Sign up

Export Citation Format

Share Document