scholarly journals Genetic Algorithm in Hill Cipher Encryption

2017 ◽  
Author(s):  
Andysah Putera Utama Siahaan

The matrix in Hill Cipher was designed to perform encryption and decryption. Every column and row must be inserted by integer numbers. But, not any key that can be given to the matrix used for the process. The wrong determinant result cannot be used in the process because it produces the incorrect plaintext when doing the decryption after the encryption. Genetic algorithms offer the optimized way to determine the key used for encryption and decryption on the Hill Cipher. By determining the evaluation function in the genetic algorithm, the key that fits the composition will be obtained. By implementing this algorithm, the search of the key on the Hill Cipher will be easily done without spending too much time. Genetic algorithms do well if it is combined with Hill Cipher.

Author(s):  
Andysah Putera Utama Siahaan

The matrix in Hill Cipher was designed to perform encryption and decryption. Every column and row must be inserted by integer numbers. But, not any key that can be given to the matrix used for the process. The wrong determinant result cannot be used in the process because it produces the incorrect plaintext when doing the decryption after the encryption. Genetic algorithms offer the optimized way to determine the key used for encryption and decryption on the Hill Cipher. By determining the evaluation function in the genetic algorithm, the key that fits the composition will be obtained. By implementing this algorithm, the search of the key on the Hill Cipher will be easily done without spending too much time. Genetic algorithms do well if it is combined with Hill Cipher.


2018 ◽  
Author(s):  
Andysah Putera Utama Siahaan

Computer security aims to help users prevent fraud or detect fraud in an information-based system. The information must be secured to be free from threats. Cryptographic techniques can prevent data theft. One cryptographic algorithm is Hill Cipher. This algorithm is one symmetric cryptography algorithm. The Hill Cipher algorithm uses an m x m sized matrix as the key to encryption and decryption. The fundamental matrix theory used in Hill Cipher is multiplication between matrices and inverses the matrix. Hill Cipher has two types of matrices in general, 2 x 2 and 3 x 3. This study discusses the order 2 x 2. The application of Hill Cipher in text-shaped media is highly recommended because it has fast encryption and decryption speeds. This method is very good at securing data that will be transmitted on an open network.


2017 ◽  
Author(s):  
Andysah Putera Utama Siahaan ◽  
Robbi Rahim

Genetic algorithms can solve complex problems, including the problems of cryptography. What problems often occur on the Hill Cipher is the waste of time to determine the numbers that are used in the encryption process. In the encryption process, it is not a problem if the key is derived from any number. However, the problem is ciphertext cannot be returned to the original message. The key that is used must have the determinant is 1. To find the value of it is something that takes time if it must be done manually. Due to the entered value to the Hill Cipher is random, Genetic algorithms can be used to optimize the search time. By using this algorithm, the determinant calculation will be more accurate and faster. The result achieved is the program can specify some combination of numbers that can be used as the encryption key Hill Cipher and it can reject the unnecessary numbers.


Author(s):  
Azzam Mujaddid ◽  
Sumarsono Sumarsono

The hill cipher algorithm has the uniqueness of using matrix multiplication in the process where the key used is a matrix that has weaknesses in the process of encryption and decryption. In this paper will be modified to the encryption process with caesar cipher substitution. The principle of the hill cipher algorithm using the multiplication of the 2x2 key matrix of keys is enhanced through process modification lies in the combination of initial character determination using the substitution of 3 caesar ciphers. From the results of this modification can be seen that the more the number of characters processed the time required will be longer. The magnitude of the determinant also affects time and size during the poses. A 1 character increment occurs if the initial character of the encryption process is an odd number.


Author(s):  
Ommi Alfina

With the increasingly widespread abuse of digital media, especially in the form of images or images, it increasingly disrupts the rights and privacy of everyone. Many forms of abuse that occur in digital media through internet facilities such as plagiarism of photographer's work, recognition of the rights of the image, to upload photos of privacy to internet media. Therefore, one way to secure digital data in the form of images is to randomize (encrypt) the images that we feel are very important so that the image can no longer be interpreted by others. If we need these data, we just need to return it (decryption) so that the encryption image can return to its original form. Hill Cipher algorithm is one method to randomize a data by encoding and multiplying the matrix. For its application in the form of image data, a trial is needed by creating a software which will then analyze the results into several color models such as RGB, Grayscale (Keabuan) and Tresholding (Black and White). From the test results, it can be concluded that the greater the input matrix value of the Hill Cipher Algorithm, the more encrypted image results will be obtained or in other words the more incomprehensible the visual form by humans. Then the Hill Cipher algorithm cannot be applied to the color threshold model (black and white) because the matrix multiplication obtained does not have a diverse range of values


2014 ◽  
Vol 568-570 ◽  
pp. 848-851 ◽  
Author(s):  
Kai Liu ◽  
Li Min Zhang ◽  
Yong Wei Sun

To resolve the problem of no guidance about how to set the values of numerical meta-parameters and difficulty to achieve optimization of Deep Boltzmann Machines, genetic algorithms are used to develop an automatic optimizing method named GA-RBMs (Genetic Algorithm-Restricted Boltzmann Machines) for this model’s aided design. Based on the Restricted Boltzmann Machines’ features and evaluation function, a genetic algorithm is designed and realizes the global search of satisfied structure. We also initialize the network’s weights to determine the number of visible units and hidden units. The experiments were conducted on MNIST digits handwritten datasets. The results proved that this optimization reduced the dimension of visible units and improved the performance of feature extracted by Deep Boltzmann Machines. The network optimized has good generalization performance and meets the demand of Deep Boltzmann Machines’ aided design.


2015 ◽  
Vol 719-720 ◽  
pp. 1140-1147 ◽  
Author(s):  
G. Lokeshwari ◽  
S. Udaya Kumar ◽  
Sree Vidya Susarla

The proliferation of digitized media due to rapid growth of network multimedia systems has created an urgent need for information security due to the ever increasing unauthorized manipulation and reproduction of original digital data. In this paper an approach based on Merkle-Hellman, ElGamal and Genetic algorithms is proposed for data encryption and decryption. The strength of the cipher is increased further by using genetic algorithm. Experimental results show that the proposed approach can be implemented on images of any size which retain the quality of the image while retrieving the original image. This aspect helps in providing the reduction in block size without compromise in the quality of the image and security as well.


2019 ◽  
Vol 2 (1) ◽  
pp. 9 ◽  
Author(s):  
Maxrizal Maxrizal

The Hill Cipher cryptosystem is a symmetry key cryptosystem. This cryptosystem uses the concept of integer over modulo p. This cryptosystem uses a matrix K as a secret key. We must choose the key matrix K which has an inverse in modulo p. This secret key matrix will be used by the sender and recipient of the message to encrypt and descript the message. For this reason, this paper will discuss the generalization of Hill Cipher using matrices over complex numbers. Calculation of determinants and inverses of the matrix K will adopt a system of determinant and inverse calculations on Hill Cipher. The results show that the proposed cryptosystem scrambles the plaintext.


2021 ◽  
Vol 6 (1) ◽  
pp. 41
Author(s):  
Endaryono Endaryono ◽  
Nurfidah Dwitiyanti ◽  
Heri Satria Setiawan

<p><em>One of several algorithms in cryptography is the Hill Cpher method. This method is used in randomizing the contents of the message using a password key in the form of a matrix with the order MXM. The product in this research is a simulation design to explain how a plaintext message is converted into cipher text with encryption and decryption processes and vice versa from ciphertext to paintext through multiplication and inverse matrix operations. using Microsoft Excel (MS Excel). In this study, a matrix with order 2x2 and modulo 26 was used. This simulation design shows how the work process visually for each step in the process of changing the message content in the Hill Cipher method. It is hoped that the results of this study can be used as a learning medium by the community, especially students and lecturers, to increase understanding and broaden their horizons about the Hill Cipher method in cryptography lectures.</em><em></em></p>


Sign in / Sign up

Export Citation Format

Share Document