scholarly journals Hill Cipher Cryptosystem over Complex Numbers

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.

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

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):  
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


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):  
Md Ismail Jabiullah ◽  
Md Zakaria Sarker ◽  
Anisur Rahman ◽  
M Lutfar Rahman

Secured message transactions are very much desirable for electronic communications in so many ways. A secured message transaction technique has been designed, developed and implemented using Java programming language. For this, a symmetric key encryption technique dynamic Hill cipher has been used for message encryption-decryption with a dynamic key length. A square-matrix of the given key length has been generated with the property that modulo operation of the product of the matrix and the inverse of that matrix is identity. The intended message is converted into binary form. Performs the bitwise-XOR operation of the equal two halves of the binary form and repeats the operations 3 times to generate the message digest (MD), and concatenate it with the message. Encrypts them using the Hill cipher technique with the key matrix and then send them to the destination. In the receiving end, the reverse process is performed to retrieve the message in secured manner. This process can be applied in many cryptographic applications as well as research works. Key Words: Security, Message Security, Message Digest, Hill Cipher and Cipher. DOI: 10.3329/diujst.v5i1.4383 Daffodil International University Journal of Science and Technology Vol.5(1) 2010 pp.62-66


2017 ◽  
Vol 1 (1) ◽  
Author(s):  
Sherly Gina Supratman

AbstrakJaringan Komunikasi seperti Internet� merupakan jaringan yang tidak aman untuk mentransmisi data, seperti teks, audio,video dan citra digital. Salah satu cara untuk pengamanan data dapat dilakukan dengan menggunakan proses kriptografi dan �steganografi. Penggunaan ini dengan tujuan untuk merahasiakan pesan yang dikirim dan sekaligus menghindarkan pesan tersebut dari kecurigaan pihak lain yang tidak berkepentingan.Pesan yang digunakan dalam makalah ini adalah berupa text dengan menyisipkannya pada gambar. Pada proses kriptografi, pesan yang berupa text akan dienkrip dengan algoritma Hill Chiper, dan kemudian pesan yang telah dienkrip akan dilakukan proses steganografi pada citra digital� 8 bit dengan skala 0 � 255, dengan metode Least Significant Bit ( LSB ).�Kata kunci: Kriptografi, Hill Chiper, Steganografi, Least Significant Bit�AbstractCommunication Networks such as the Internet are unsafe networks for transmitting data, such as text, audio, video and digital imagery. One way to secure data can be done by using cryptography and steganography process. This use is for the purpose of concealing messages being transmitted and avoiding such messages from the suspicion by others who are not interested.The message used in this paper is text by inserting it in the image. In the cryptographic process, text messages will be encrypted with the Hill Chiper algorithm, and then the encrypted message will be steganographed on 8-bit digital images on a scale of 0-255, using the Least Significant Bit (LSB) method.�Keywords: Cryptography, Hill Chiper, Steganography, Least Significant Bit


Author(s):  
Dian Rachmawati ◽  
Mohammad Andri Budiman ◽  
Wiro Tirta Habibi
Keyword(s):  

2018 ◽  
Vol 11 (3) ◽  
pp. 774-792
Author(s):  
Mutti-Ur Rehman ◽  
M. Fazeel Anwar

In this article we consider the matrix representations of finite symmetric groups Sn over the filed of complex numbers. These groups and their representations also appear as symmetries of certain linear control systems [5]. We compute the structure singular values (SSV) of the matrices arising from these representations. The obtained results of SSV are compared with well-known MATLAB routine mussv.


2017 ◽  
Author(s):  
hasdiana

This preprint has been presented in the 3rd International Conference on Multidisciplinary Research, Medan, october 16 – 18, 2014---In this study the authors use the scheme of Shamir's Three Pass Protocol for Hill Cipher operation. Scheme of Shamir's Three Pass Protocol is an attractive scheme that allows senders and receivers to communicate without the key exchange. Hill Cipher is chosen because of the key-shaped matrix, which is expected to complicate the various techniques of cryptanalyst. The results of this study indicate that the weakness of the scheme of Shamir's Three Pass Protocol for XOR operation is not fully valid if it is used for Hill Cipher operations. Cryptanalyst can utilize only the third ciphertext that invertible. Matrix transpose techniques in the ciphertext aims to difficulties in solving this algorithm. The original ciphertext generated in each process is different from the transmitted ciphertext. The level of difficulty increases due to the use of larger key matrix. The amount of time required for the execution of the program depends on the length of the plaintext and the value of the matrix element. Plaintext has the same length produce different execution time depending on the value of the key elements of the matrix used.


Sign in / Sign up

Export Citation Format

Share Document