Affine Cipher Research Articles

Two Novel Multidimensional Affine Variations of the Hill Cipher

Two novel symmetric multidimensional affine nested variations of the Hill Cipher are presented. The Hill Cipher is a block polygraphic substitution encryption scheme based on a linear transformation of plaintext characters into ciphertext characters. In the time since Hill first published his encryption scheme, variations, modifications, and improvements of theoretical and practical importance have been published every year indicating that the Hill Cipher is an active area of cryptography research. The first variation presented in this paper incorporated invertible key matrices of orders 2, 4, and 8 such that the matrix values of the <i>2×2</i> matrix rotate positions with each block of characters in a similar manner to the rotating letter wheels of a German Enigma Encoder, then results of the <i>2×2</i> key matrices output are passed to <i>4×4</i> key matrices, and <i>8x8</i> key matrix, <i>4×4</i> key matrices, and rotative-value <i>2×2</i> key matrices. The second variation is configured with invertible key matrices of orders 4, 8, and 16 without rotation of matrix values in a similar manner to the first variation. In both variations, plaintext characters of each block are operated on by exclusive-or (XOR) vectors prior to multiplication with the matrices to create the affine ciphers. Strengths, weaknesses, and other considerations are provided in the discussion. Two proposals are also argued with rationale for a more robust character set for encryption and the increase in modulus that the character set allows, and the possible advantages and disadvantages of affine XOR vectors.

Enhancing Security of Text Using Affine Cipher and Image Cryptography

Enhancing Security of Text Using Affine Cipher and Image Cryptography

Enhanced Vigenere and affine ciphers surrounded by dual genetic crossover mechanisms for encrypting color images

This paper introduces an enhanced technique for encrypting color images, surpassing the effectiveness of genetic crossover and substitution methods. The approach integrates dynamic random functions to bolster the integrity of the resulting vector, elevating temporal complexity to deter potential attacks. The enhancement entails amalgamating genetic crossover using two extensive pseudorandom replacement tables derived from established chaotic maps in cryptography. Following the controlled vectorization of the original image, our method commences with an initial genetic crossover inspired by DNA behavior at the pixel level. This process is followed by a confusion-diffusion lap, strengthening the relationship between encrypted pixels and their neighboring counterparts. The confusion-diffusion mechanism employs dynamic pseudorandom affine functions at the pixel level. Subsequently, a second genetic crossover operator is applied. Simulations conducted on various images with varying sizes and formats demonstrate the resilience of our approach against statistical and differential attacks.

A Multistage High Capacity Reversible Data Hiding Technique Without Overhead Communication

Reversible Data Hiding(RDH) has been extensively investigated, recently, due to its numerous applications in the field of defence, medical, law enforcement and image authentication. However, most of RDH techniques suffer from low secret data hiding capacity and communication overhead. For this, multistage high-capacity reversible data hiding technique without overhead is proposed in this manuscript. Proposed reversible data hiding approach exploits histogram peaks for embedding the secret data along with overhead bits both in plain and encrypted domain. First, marked image is obtained by embedding secret data in the plain domain which is further processed using affine cipher maintaining correlation among the pixels. In second stage, overhead bits are embedded in the encrypted marked image. High embedding capacity is achieved through exploiting histogram peak for embedding multiple bits of secret data. Proposed approach is experimentally validated on different datasets and results are compared with the state-of-the-art techniques over different images.

Three Pass Protocol for Key Security Using Affine Cipher Algortima and Exclusive-or (Xor) Combination

Information is a very important concern in today's technological era, especially in terms of security through the exchange of information that is so fast that people can easily get various kinds of information. Information obtained easily through recording or openly disseminating data, XOR Cipher is an algorithm used to secure messages and texts but has weaknesses due to simple computation, therefore to strengthen security in XOR Cipher communication protocols can be added to secure key exchange on XOR Ciphers. Affine Cipher can be combined with Exclusive-OR (XOR) for text message security. Through the Affine Cipher algorithm with Key can change the unknown Plaintext, so that the Plaintext is kept secret. The Exclusive-OR (XOR) combination by changing each Character in each Plaintext according to the ASCII Code table can shorten the Key encoding process, so that Plaintext remains safe to send. The Affine Cipher Algorithm and the Exclusive-OR (XOR) Combination for Plaintext security levels are better because the Plaintext encryption and decryption processes are carried out twice with different cryptographic algorithms.

SECURE TEXT ENCRYPTION FOR IOT COMMUNICATION USING AFFINE CIPHER AND DIFFIE-HELLMAN KEY DISTRIBUTION ON ARDUINO ATMEGA2560 IOT DEVICES

In an Internet of Things (IoT) system, devices connected to the system exchange data. The data contains sensitive information about the connected devices in the system so it needs to be protected. Without security, the data in the IoT system can be easily retrieved. One way to prevent this is by implementing cryptography. Cryptography is a technique for protecting information by using encryption so that only the sender and receiver can see the contents of the information contained therein. The implementation of cryptography on IoT devices must consider the capabilities of IoT devices because in general IoT devices have limited processing capabilities compared to computer devices. Therefore, the selection of encryption algorithms needs to be adjusted to the computational capabilities of IoT devices. In this research, the affine cipher cryptography algorithm and Diffie-hellman key distribution algorithm are applied to the arduino atmega2560 IoT device. The purpose of this research is to increase the security of the IoT system by implementing cryptography. The method used in this research involves setting up a sequence of encryption and decryption steps using an affine cipher and diffie-hellman algorithms. Furthermore, these algorithms were implemented on an Arduino IoT device. Finally, the decryption time based on the number of characters and the avalanche test were tested. The results showed that on average, Arduino can perform decryption using affine cipher and diffie-hellman algorithms in 0.07 milliseconds per character. The avalanche test produced an average percentage of 45.51% from five trials.

Implementation Of Affine Cipher Combination And Merkle Hellman On The Process Digital Image Security

The use of image media information has several weaknesses, one of which is the ease with which it can be manipulated by irresponsible people. Efforts made in increasing the security of this image is cryptography, namely the science and art of maintaining the security and confidentiality of images. Cryptography is used so that the confidentiality of the image can be maintained, so that it is not known by others. In general, there are 2 (two) techniques for carrying out cryptographic processes, namely encryption and decryption. In this study, the encryption process was first carried out using the Affine Cipher algorithm and then continued with the Merkle Hellman algorithm, while the decryption was carried out first by Merkle Hellman and then decrypted again with the Affine Cipher. The results of this study indicate that applying the Affine Cipher and Merkle Hellman algorithms can secure images. At the end of this system is an image that is in the form of blur so that it is not known and not understood by others. That way people who are not entitled cannot understand from the image.

DEVELOPMENT OF HYBRID ENCRYPTION METHOD USING AFFINE CIPHER, VIGENERE CIPHER, AND ELGAMAL ALGORITHM TO SECURE TEXT MESSAGES IN DATA COMMUNICATION SYSTEM

With the development of technological advances in this day and age, it definitely requires a security system on messages and data. The way to maintain the security of data, messages or information requires a branch of science in its application, one of which is the algorithm or cryptography method. In its application, it requires more than one stage of the security process, because data security can be done by combining methods in its security techniques. This research aims to develop encryption methods using Affine Cipher, Vigenere Cipher, and ElGamal Algorithm to secure text messages. Affine cipher, Vigenere cipher and ElGamal are cryptography that can encrypt and decrypt text messages. Encryption is changing the message or plaintext into an unreadable message or ciphertext, on the other hand, decryption changes the ciphertext or message that initially cannot be read into a message that can be read or plaintext back in its original form. The result of this research is the development stage by doing three encryption and decryption processes. For the first encryption process using Affine Chiper which produces the initial ciphertext, then re-encrypted using Vigenere Cipher, then the previous encryption results are carried out ElGamal encryption which produces the final ciphertext. Conversely, the decryption process is first on ElGamal, then Vigenere Cipher, and finally Affine Cipher whose decryption results in plaintext back in the form of the initial text message. So that by developing and combining three algorithm methods can increase the security of information and text messages.

Implementation of Affine Group Algebra on Digital Image Security

The concept of group theory has been applied to digital image security using the DES algorithm and wavelet transform. Affine Cipher algorithm was a symmetric cryptographic algorithm. This was initiated for studying further the implementation of the Affine group on the Affine transformation. More over, digital image used the Affine algorithm in security. The purpose of this paper was described the implementation of the existence of an Affine Group in the Affine transformation carried out in digital image cryptography. The concept of maintaining geometric shapes in Affinetransformations and bijective nature of each Affine transformation could be formed an Affine group.

The Scope of Application of Letter Frequency Analysis in Substitution Cipher

Since its inception, substitution ciphers have been a popular type of cipher, and over time, academics have studied them in an effort to discover patterns that will allow them to be broken. They created it because substitution ciphers are a reasonably simple type of cipher. Through a survey of the literature, this paper investigates the encryption and decryption of three sub-types of monoalphabetic ciphers: shift cipher, affine cipher, and random substitution cipher. Letter frequency analysis is the foundation of the primary decryption technique. After that, two sub-kinds of monoalphabetic ciphers, Hill cipher and Playfair cipher, which are resistant to this decryption method because the letters encrypted hardly keep the original frequency, will be introduced. The paper shows that statistical analysis of letter frequency is only useful for deciphering single-table substitution ciphers.

Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph

An edge labeling of graph G is a function g from the edge set of graph G to the first natural numbers up to the number of the edge set. Graph G admits a rainbow vertex antimagic coloring if, for any two vertices, there is a path with different colors of all internal vertices. The vertex color of graph G is assigned by vertex weight. The vertex weight of graph G is obtained by summing all edge labels that incident with that vertex. The rainbow vertex antimagic connection number of graph G, denoted by rvac(G) is the smallest number of different colors induced by rainbow vertex antimagic coloring. In this research, we determine the upper bound of the rainbow vertex antimagic connection number (rvac) on a cycle graph (Cn) and create a secured cryptosystem using a modified Affine Cipher based on rainbow vertex antimagic coloring.

A Cryptosystem of Skewed Affine Cipher of Multiple Keys

In this era, where communication over technology has become vital, the reliability of the same is of utmost need. Cryptography ensures confidentiality, user authentication, and integrity of data. One of the techniques is the Elliptic Curve Cryptography (ECC). Several classical ciphers are designed based on mathematical backgrounds. In this paper, we focus on combining Affine Cipher and ECC to magnify the security provided by an Affine cipher. Hence a skewed Affine cipher that uses multiple keys over Elliptic curves is proposed. The keys chosen are derived from the points on the specified Elliptic curve, which forms a cyclic group or a cyclic subgroup.

An Asymmetric Cryptosystem of Skewed Affine Cipher Over Elliptic Curves with Block Matrix

The retaining of confidentiality in data transmission with user authentication has become eminent for easy and secure communication. This is achieved by using the art of cryptology at its best. Various ciphers are developed balancing time, memory, and security. In particular, the invertible property is the basic requirement in constructing a secure cryptosystem. In this paper, an invertible block matrix is constructed over Fibonacci sequences. The sender and the recipient can derive the block matrix through the key exchanged over a secure channel for encryption and decryption. Also, an asymmetric cryptosystem is designed based on the skewed Affine cipher, which uses a bijective map over points on an elliptic curve. The developed cryptosystem is resistant to cryptanalytic attacks.

Data Encryption Using Face Antimagic Labeling and Hill Cipher

An approach to encrypt and decrypt messages is obtained by relating the concepts of graph labeling and cryptography. Among the various types of labelings given in [3], our interest is on face antimagic labeling introduced by Mirka Miller in 2003 [1]. Baca [2] defines a connected plane graph <img src=image/13426646_01.gif> with edge set <img src=image/13426646_02.gif> and face set <img src=image/13426646_03.gif> as <img src=image/13426646_04.gif> face antimagic if there exist positive integers <img src=image/13426646_05.gif> and <img src=image/13426646_06.gif> and a bijection <img src=image/13426646_07.gif> such that the induced mapping <img src=image/13426646_08.gif>, where for a face <img src=image/13426646_09.gif>, <img src=image/13426646_10.gif> is the sum of all <img src=image/13426646_11.gif> for all edges <img src=image/13426646_12.gif> surrounding <img src=image/13426646_09.gif> is also a bijection. In cryptography there are many cryptosystems such as affine cipher, Hill cipher, RSA, knapsack and so on. Amongst these, Hill cipher is chosen for our encryption and decryption. In Hill cipher [8], plaintext letters are grouped into two-letter blocks, with a dummy letter X inserted at the end if needed to make all blocks of the same length, and then replace each letter with its respective ordinal number. Each plaintext block <img src=image/13426646_13.gif> is then replaced by a numeric ciphertext block <img src=image/13426646_14.gif>, where <img src=image/13426646_15.gif> and <img src=image/13426646_16.gif> are different linear combinations of <img src=image/13426646_17.gif> and <img src=image/13426646_18.gif> modulo 26: <img src=image/13426646_19.gif> (mod 26) and <img src=image/13426646_20.gif> (mod 26) with condition as <img src=image/13426646_21.gif> is one. Each number is translated into a cipher text letter which results in cipher text. In this paper, face antimagic labeling on double duplication of graphs along with Hill cipher is used to encrypt and decrypt the message.

Improving the robustness of the affine cipher by using a rainbow antimagic coloring

Nowadays, cryptosystems can be applied in several areas in life. One of them is in transaction data. In transaction data, a very strong cryptosystem is needed so that the transaction data is safe. Cryptosystems are better with a strong keystream. In this case, we use rainbow antimagic as a cryptosystem key to improve the robustness of the keystream by using affine cipher. The algorithm uses the edge weights of rainbow antimagic vertex labeling of graphs as a key for encryption and decryption. In this paper, we found the rainbow antimagic connection number of tadpole graphs and two algorithms to straighten affine ciphers.

Security of multiple RGB images in the time domain and frequency domain

Secure and efficient transmission of images from a sender to a receiver through the public channel has become a prime agenda. An encryption algorithm to secure three color images simultaneously using matrix affine cipher, factional discrete cosine transform and Arnold transform is proposed in this paper. In earlier proposed algorithms, pixel intensities were not changed but rather shifted. In our proposed algorithm, pixel intensities are both shifted and changed. The color maps of the three color images are extracted to convert three color images into three indexed images respectively. The three indexed images are taken as R(red), G(green) and B(blue) channels of a color image. The color image is encrypted using the proposed encryption algorithm. The encryption algorithms for the security of color images proposed so far are secure either in time domain or in frequency domain, but the proposed encryption algorithm is secure in both the time and the frequency domain without any loss of data. The security of the proposed encryption algorithm depends not only upon secret keys but also upon the correct arrangement of the secret keys as compared to existing similar encryption algorithms whose security depends only upon secret keys. The encrypted(cipher) image is a single color image and is favorable for secure and efficient transmission over the public channel. Simulation is done with standard examples to analyze the validity of the proposed encryption scheme. We have provided the complete security analysis, statistical analysis and comparison with the existing similar encryption algorithms.

Penerapan Algoritma Hybrid Affine Cipher dan RSA Terhadap Sistem Keamanan

The higher the value of a data, the higher the risk of damage or loss of the data. This is understandable, because high-value data is like "life" for humans, so if a data has been damaged or even lost, then the data has no meaning anymore. There are many ways to protect data. Data protection uses a method called encryption process which encodes the code in the original text into arbitrary characters. So that the contents of the encrypted data can be read again, it is necessary to change the contents of the data to its original form, this process is called decryption. In this study, a File Security System Protection Application Design was made using a hybrid affine cipher and the RSA algorithm. This application is made using the Delphi 7.0 Programming Language.

Visual Encryption Using Block based Scrambling Followed by Affine Encryption Technique

This article reports the Block based cipher concept followed by the affine cipher technique. The Image considered was grouped into squared (16, 32 and 64) pixel blocks then each column was shifted by specific values. These values were randomly generated prime numbers and worked as the key for scrambling. These images were investigated for their quality of scrambling using histogram and adjacent pixel correlation. The adjacent pixel correlations for 16, 32 and 64 pixel-based ciphered images were found as 0.7907, 0.7292, and 0.4783 respectively. The analysis gave the information that the level of scrambling was not satisfactory, therefore; the affine cipher technique was applied to each of the images. These images were converted into the matrix format and each element was transformed using the affine cipher. This transformed matrix is again converted inform from the image to visualize. The Histogram and adjacent pixel correction for these images were much improved.

An implementation of Rabin-p cryptosystem and affine cipher in a hybrid scheme to secure text

One way to keep digital information secure is by using cryptographic techniques. With respect to its keys, cryptography generally is divided into two types: symmetric and asymmetric. Symmetric cryptography algorithm uses the same key in both encryption and decryption while asymmetric uses different keys for each of these processes. Asymmetric cryptography algorithm is known to be ineffective to encrypt big messages since it takes more CPU time to do the computation and the resulting ciphertext is usually much bigger than the original message. To eliminate these problems, in this research, we combine Rabin-p cryptosystem, an asymmetric cryptography algorithm, and affine cipher, a symmetric cryptography algorithm, in a hybrid scheme in order to secure messages from unwanted parties. The affine cipher is used for message encryption while Rabin-p is used for affine cipher’s key encryption. The result of this research is a hybrid cryptography scheme that can encrypt and decrypt message in the form of *.pdf files and be able to restore the message without losing integrity.

Multi-layer color image encryption using random matrix affine cipher, RP2DFrHT and 2D Arnold map

Confidentiality, integrity, authenticity, non-repudiation and storing and transmitting images over the unsecured channel has become a challenging task nowadays. In this scenario, a robust image encryption technique over open network has grasped a great deal of attention. In this paper to meet this challenge, we have established a new multi-layer robust color image encryption using random matrix affine cipher (RMAC), reality preserving two dimensional discrete fractional Hartley transform (RP2DFrHT) and two dimensional Arnold map. The first stage of encryption is designed through RMAC. RMAC provides security in co-ordinate domain as well as in geometrical domain. So if a hacker has knowledge about all the pixels of an image, but has no information about the mechanism of co-ordinate domain he/she cannot steal any information. The second stage of encryption is obtained incorporating the concept of RP2DFrHT. The reality preserving transform eliminates the complex-valued coefficients and provides the real-valued coefficients of encrypted image. The real-valuedness of data provides convenient platform for display, storage and transmission in digital domain. The third stage of encryption is done using 2D Arnold map, which not only enhances the security but also enlarges key space. Therefore, the proposed technique provides security in geometrical, co-ordinate, frequency and time domains simultaneously. The security of our proposed technique depends upon the secret keys as well as their correct arrangements. Simulation analysis provides the complete visual results of all stages of encrypted and decrypted images. Sensitivity analysis validates that our proposed technique is highly sensitive towards its secret keys and their arrangements. Statistical analysis such as histogram analysis, MSE, PSNR, correlation coefficient, entropy analysis and resistivity of classical attacks validates the effectiveness and feasibility of our proposed work. Moreover, comparison analysis testifies that our proposed technique functions significantly well as compared to existing similar techniques.