Affine Cipher Research Articles

A novel image encryption using random matrix affine cipher and the chaotic maps

Security issues are at its peak by the expanding pace of innovation and the utilization of interactive media over the internet. To overcome such security issues, cryptography, steganography and watermarking methods are utilized eventually. In this work, we have fabricated a lossless cryptographic technique for image encryption using random matrix affine cipher (RMAC) associated with the chaotic maps of 2D Hénon (HN) and logistic. The method gives multi-layer security to forestall unauthorized access during transmission over the public networks. This method of encryption is fast with a high throughput of correlated data and works efficiently when compared to some available existing schemes. Numerical simulations and performance analysis insured the security, validation and stalwartness of the presented scheme. Further, the proposed scheme can be efficiently used in practice for secure transmission in wireless applications and small system devices.

Local super anti-magic total face coloring on shackle graphs

We define graph G as a nontrivial, finite, connected graph which contains vertex set V (G), edge set E(G), and face set F (G). We also define g as bijective function that mapping vertex, edge, and face labeling to natural number which starting from 1 until |V(G)| for vertex label, from |V(G)| + 1 until |V(G)| + |E(G)| for edge label, and the last for face label from |V (G)| + |E(G)| + 1 until |V (G)| + | E (G)| + |F(G)|. If there are different weights in any neighboring two faces f1 and f2 has w(f1) = w(f2) for f1, f2 G F (G), so g is considered a local super anti-magic total face labeling. A proper face coloring from local super anti-magic total face labeling caused by assigns the color of face weights to local super anti-magic total face coloring. The minimum number of colors needed for local super anti-magic total face coloring is called The chromatic number of the local super anti-magic total face coloring. γlatf (G) can be denoted as the chromatic number of the local super anti-magic total face coloring. Encryption keys can possibly be created from the result of local super anti-magic total face coloring that can be used to construct a modified Affine cipher and Cipher Feedback Mode. As a result, we have one the orem for the chromatic number of local super anti-magic total face coloring and two algorithms for establishing super anti-magic total face coloring on shackle graphs in Cipher Feedback Mode.

Encryption of Data based on Triple encryption and Affine Algorithm

In recent years in view of the recent scientific and technological development, Encryption has emerged as a solution and is critical in the information security system. To protect the shared data, a variety of techniques are needed. To begin, data must be encrypted before being sent from sender to receiver using a cryptographic algorithm for encryption. Second, the receiver can display the original data using decryption techniques. Encryption is a well-known method of safeguarding classified information. It is a procedure for converting text or data into an unreadable format for the purpose of hiding this data or is converting plaintext to ciphertext is an operation. In conjunction with an algorithm or a key. The current research focuses on using cryptography to protect data as it is being transmitted, we implemented three encrypt techniques (Caesar-Reversing-zigzag) by combining the three codes called triple encryption for encrypting the message, re-encoding the encrypted text using the affine cipher. The present work is implemented by using Visual Basic 6.

An application of super mean and magic graphs labeling on cryptography system

An edge-magic total (EMT) labeling on a simple graph G with p vertices and q edges is a bijection f: V∪E→{1, 2, …, p + q} such that for each edge xy of G, f(x) + f(xy) + f(y) = k, for a fixed positive integer k. Moreover, an EMT labeling f is a super edge-magic total labeling (SEMT) if f(V) = {1, 2, …, p}. Furthermore, a graph G is called a super mean (SM) graph if there exists an injective function f from the vertices of G to {0,1,2,…,q} such that when each edge uv is labeled with (f(u) +f(v))/2 when f(u) +f(v) is even, and (f(u) +f(v) + 1)/2 when f(u) +f(v) is odd, then the resulting edge labels are distinct. There are two essentials results that will be proposed in this paper. In the first result, we show that a graph (n, 1) − F Caterpillar has a SM labeling and a graph Hu,y has a SEMT labeling. In the second result, we will give an application of these labeling to increase the security level of Affine Cipher in which to encrypt a text on socials media.

Cryptography Protection of Digital Signals using Fibonacci - Pell Transformation via Golden Matrix

At this time the security of communication can be the important role of electronic communication. In this paper we can discuss the new transform for the protection of digital signals using with golden matrix. Fibonacci - Pell (FP) Transform can be find sufficient results to secure the signals and the aims of this paper to describe the security of signals using new type of recurrence formula. The recurrence relation can be find sufficient results to secure the signals. Multiple encryptions are used in this algorithm. Fibonacci - Pell (FP) Transform used for encryption and affine cipher can be used for super encryption. It ensures that to secure the data from attackers in this cryptographic method is fast and simple.

Significant role of the specific prime number p = 257 in the improvement of cryptosystems

Cryptology is the significant science which is inseparable from the means of communication of secrets. In a safe manner, it has the main objective of transmitting (potentially sensitive) information between two interlocutors. One distinguishes mainly two “dual” disciplines within cryptology: (a) cryptography, which is interested in the security of information. (b) cryptanalysis, which seeks to attack it. One have a starting set of 256 elements, we add a new element to this set to form a set of 257 elements. In this paper, we consider a finite field that contains 257 elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers modulo p when p is a prime number. For our case ℤ/pℤ, p = 257. We apply it to affine ciphers and show that this cipher looks like a permutation cipher. The idea based on this result, is to use the affine ciphers with the modulo 257 (as an initial permutation) in any specific algorithm of ciphering. Besides, one finishes with the decryption affine with the modulo 257 like an inverse permutation. This is to significantly increase the security of the specific encryption algorithm and to lengthen the 16-bits encryption key.

Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator

In this paper, we present a new type of symmetric encryption by converting the classical monoalphabetic affine cipher into a polyalphabetic cipher. The proposed encryption utilizes the properties of outer-convex dominating set in the corona of graphs to generate random keys from the shared keyword to every character of the message. The new encryption eliminates the weaknesses of affine cipher, thus increasing the level of confidence for exchanging messages.

Cryptography: A Combination of Caesar and Affine Cipher to Conceal the Message

Advances in technology make it easy for humans to communicate with each other. One of them is by sending messages. However, the confidentiality of messages can be hacked by third parties. Therefore, it is necessary to secure the messages sent so that confidentiality can be maintained. One way that can be done to maintain message security is cryptography. Classical cryptography has several types of algorithms including caesar cipher and affine cipher. The purpose of this study is to combine caesar cipher and affine cipher as one technique that can be used to secure messages. This combination is done by changing the plaintext into ciphertext 1 through caesar encryption. Ciphertext 1 is encrypted by affine caesar to produce ciphertext 2. Ciphertext 2 is the message to be sent. Then to change to original message ciphertext 2 is decrypted by affine chiper so that it gets plaintext 1. Then plaintext 1 is decrypted by caesar chiper so that it gets plaintext 2. Plaintext 2 is the message that should be received. The result of this study are a combination of caesar cipher and affine cipher can secure a message sent.

Modified Vegenere Cipher to Enhance Data Security Using Monoalphabetic Cipher

The rapid progression of exchange data by public networks is important, especially in information security. We need to keep our information safe from attackers or intruders. Furthermore, information security becomes needed for us. Many kind cipher methods of cryptography are improved to secure information such as monoalphabetic cipher and polyalphabetic cipher. Cryptography makes readable messages becoming non-readable messages. One of the popular algorithms of a polyalphabetic cipher is Vigenere cipher. Vigenere cipher has been used for a long time, but this algorithm has weaknesses. The calculation of the encryption process is only involving additive cipher, it makes this algorithm vulnerability to attacker based on frequency analysis of the letter. The proposed method of this research is making Vigenere cipher more complex by combining monoalphabetic cipher and Vigenere cipher. One of the monoalphabetic ciphers is Affine cipher. Affine cipher has two steps in the encryption process that are an additive cipher and a multiplicative cipher. Our proposed method has been simulated with Matlab. We also tested the vulnerability of the result of encryption by Vigenere Analyzer and Analysis Monoalphabetic Substitution. It shows that our method overcomes the weakness of Vigenere Cipher. Vigenere cipher and Affine cipher are classical cryptography that has a simple algorithm of cryptography. By combining Vigenere cipher and Affine cipher will make a new method that more complex algorithm.

Application of Linear Congruent Generator in Affine Cipher Algorithm to Produce Dynamic Encryption

Modification of the original message (plaintext) with the LCG random number generator algorithm and encryption with the affine cipher algorithm to produces a dynamic and safe random message (ciphertext) compared to just the affine cipher algorithm. The plaintext is converted to ASCII code and stored in a data list. The data list that contain the plaintext changes the position of the data where each plaintext column is moved to an odd column and even columns are filled by random numbers generated by LCG. The data list is then changed again by adding value to each column with random numbers generated by the programming language and then it encrypted with the affine cipher algorithm. The total number of ciphertexts can be twice as many as the plaintext. The results obtained are not the same ciphertext character even though the plaintext has the same character. Ciphertext generated in the first run program will be different for the next run program or dynamic encryption. To restore a ciphertext to the plaintext is done based on the affine cipher decryption function and the steps to modify the message that was done before.

DIFFERENCE MODULO LABELING

In this paper, We prove that cycle Cn is a difference modulo labeled graph. We investigate the graph and is a difference modulo labeling. Here, the formulated edge labeling is considered as plaintext and with the help of affine cipher, we investigate a method of encryption and decryption of a message for the system of secured communication.

Practical understanding of the operating principle of digital communication systems

There are many students and researcher who doesn’t really understand the practical operating principle of digital communication system. Hence in this paper, the digital communication system is studied and simulated. In the system kit development text and audio inputs are taken and encrypted with different encryption techniques including additive cipher, multiplicative cipher and affine ciphers. The encrypted data is converted in to an 8-bit binary, channel encoded with distinct channel coding styles like linear block encoder, cyclic encoder and convolutional encoder, line coded and band pass modulated by different digital modulation techniques. Finally, the developed software is tested with equivalent inputs of the current national TV broadcasting and the results found are correct according to the theoretical analysis of the discussion.

PENGAMANAN POLYALPHABETIC DENGAN AFFINE CIPHER BERDASARKAN BARISAN FIBONACCI

Affine cipher is a classic cryptographic algorithm substitution technique. Substitution technique is the encryption process for every character in the plaintext will be subtituted by another character. Affine cipher uses two types of keys. Each character of plaintext to be encrypted substituted by the same key. This research discusses about modify one of the key affine cipher, to produce a different key that will be substituted with each plaintext character. Key modifications are made by the Fibonacci sequence rules. This study also compares affine cipher and key modification affine cipher by finding corelation coeffiecient values. The results obtained from the comparison of the two algorithms, encryption that uses affine cipher key modification is better than affine cipher.
 Keywords: Cryptography, Affine Cipher, Fibonacci, Correlation Value

Analysis of Possibility of the Combination of Affine Cipher Algorithm with One Time Pad Cipher Using the Three-Pass Protocol Method in Text Security

The use of the Three-Pass Protocol method in exchanging secret text messages is one effective method because the two interested parties do not need to use a single key to open the message sent. But there is a possibility that the message cannot be described because the cipher used is not suitable. The purpose of this study is to show whether the Affine Cipher Algorithm with One Time Pad Cipher using the Three-Pass Protocol method can be used to encrypt and decryption the text message.

Application Of Rectangular Matrices: Affine Cipher Using Asymmetric Keys

In cryptography, we know the symmetric key algorithms and asymmetric key algorithms. We know that the asymmetric key algorithm is more secure than the symmetric key algorithm. Affine Cipher uses a symmetric key algorithm. In this paper, we introduce the Affine Cipher using asymmetric keys. Asymmetrical keys are formed from rectangular matrices.

A combination of Rivest Shamir Adlemann (RSA) and Affine Cipher method on improvement of the effectiveness and security of text message

Rivest Shamir Adlemann (RSA) method is one of the popular methods in the field of public key cryptography. The strength of the RSA method is based on the difficulty level of factoring of two large prime numbers. If they are factored easily, then we need to use brute force to break the system. In this present, we combined RSA method with classical method, namely Affine Cipher method to improve the level of security on text message. The process of combination RSA method and Affine Cipher method is as follow: first, text message was encryption using Affine Cipher method, then the encryption output is used as input of the RSA method. The results certified that the improvement of the security level of text message can be realized by using the combined method.

IMPLEMENTASI KOMBINASI AFFINE CIPHER DAN ONE-TIME PAD DALAM PENGAMANAN PENGIRIMAN PESAN

In an exchange of messages that occur offline and online is very vulnerable to the threat of information theft with a combination of Affine Cipher and One-time Pad is expected to secure a message that is difficult to solve from information theft (Cryptanalysis). Affine Cipher works by using the two integer and One-time Pad keys using keys that match the existing text and the key is randomly generated. The combination of two algorithms is expected to secure information and can return back to its original form (Plainteks), so as not to cause any data lost or excessive. Plainteks, Affine Cipher, Cipherteks, One-time Pad, Cipherteks, Plainteks. Keywords : Cryptography, Affine Cipher, OTP.

BEBERAPA MODIFIKASI PADA ALGORITMA KRIPTOGRAFI AFFINE CIPHER

Affine Cipher Cryptography Technique is one of the techniques in classical cryptography which is quite simple so it is very vulnerable to cryptanalysis. Affine cipher's advantage is having an algorithm that can be modified with various techniques. The modifications that can be made to Affine Cipher is to combine Affine cipher's algorithm with other ciphers, replace Affine cipher's key with various functions and matrices and expand the space for plaintext and ciphertexts on Affine cipher. Affine cipher can also be applied to the stream cipher as a keystream generator. This research discusses several modifications of Affine cipher algorithm and performs several other modifications. These modifications are combining Affine Chiper and Vigenere Cipher on , combining Affine, Vigenere and Hill Cipher with invertible matrix applications on . Furthermore, a comparison of the three modifications will be carried out to obtain a new cryptographic method that is more resilient to the cryptanalysis process.

Aplikasi Pembelajaran Algoritma Affine Cipher Dan Vigenere Cipher Menggunakan Metode Computer Assisted Instruction

Learning is a process of communication between teachers and students. Cryptographic learning is very important for computer students to know the ways to secure data. Then learning is needed about data security, namely using cryptographic methods with the Affine Cipher algorithm and vigenere cipher. The Affine Cipher algorithm is a form of classical cryptography that uses the nature of substitution in the process of encoding data where the process is done by multiplying each plaintext value by a value and adding it with a shift. Vigenere Cipher algorithm is one form of classical cryptography with substitution techniques. Computer Assisted Instruction (CAI) is a computer for presenting learning material that aims to make students more active in learning material in the use of computer media. In its development Computer Assisted Instruction (CAI) has five learning system models namely tutorial models, practice models and exercises, problem solving models, simulation models, and game models, the advantages of Computer Assisted Instruction (CAI) in education can increase student motivation in learning, improve student understanding in the material presented.

Penerapan Metode End Of File Pada Steganografi Citra Gambar dengan Memanfaatkan Algoritma Affine Cipher sebagai Keamanan Pesan

The development of the world of information technology is very fast lately influential in all aspects of life. Kriprografi is a science based on mathematical techniques to deal with information security such as confidentiality, data integrity, and entity authentication. Affine Cipher or Affine password is a substitution cipher that is specifically for encryption or decryption per character. Therefore, Affine's password includes the stream cipher cryptographic algorithm. Steganography is a way of hiding the contents of a data in a cover of media or other digital data that cannot be predicted by ordinary people so as not to arouse suspicion from those who see it. The steganography image file has the same number of pixels as the original image file and there is no color difference between the two. The size of the steganography image file will increase, according to the length of the hidden message plus 6 bytes, in the form of 1 byte EOF and 5 byte message length. The End Of File (EOF) method is a technique for inserting data at the end of a file. When opened with a photo editor application, both images have the same pixel size, namely 240 x 238, and do not change color. In this test, what changes is the size of the image file, ie the initial size of the image is 49.132 bytes, changes to 49.145 bytes, or there is an addition of 13 bytes