Hill Cipher Algorithm Research Articles

Enhanced Data Security Using 5x5 Hill Cipher with Modular 53

This research presents an optimized approach to the Hill Cipher encryption and decryption algorithm using a 5x5 matrix and modular 53 arithmetic. The traditional Hill Cipher, a well-known symmetric key algorithm, typically utilizes smaller matrices and modular arithmetic, which may not provide sufficient security for contemporary applications. By expanding the key matrix to a 5x5 structure and adopting a larger modulus of 53, the complexity and security of the cipher are significantly enhanced. The study details the methodology for constructing and implementing the 5x5 key matrix, as well as the processes for encryption and decryption under the modular 53 system. The computational efficiency and security improvements achieved through this optimization are analyzed. Comparative assessments with the conventional Hill Cipher demonstrate that the enhanced approach offers superior resistance against cryptographic attacks while maintaining manageable computational requirements. The results of this research indicate that the proposed optimized Hill Cipher can serve as a robust encryption method suitable for securing sensitive data in various modern applications. This study contributes to the field of cryptography by providing a more secure and efficient variant of the classical Hill Cipher algorithm

Development of Hill Cipher Method For Encryption And Decryption of Drug Prescriptions to Improve Data Security

A prescription is a written request from a doctor to a pharmacist, as not everyone can know the dosage or type of a particular drug, especially patients who need a prescription for the drug must be kept secret. Rapid technological advances can have an impact on all sectors, both private and government, including the medical field. One of the medical services that utilizes IT is to send prescription messages electronically to pharmacists in response to doctors' requests. The many misuse of prescription drugs by irresponsible people and misreading prescription drugs by pharmacists can be fatal for patients, so a solution is needed to overcome these problems. The purpose of this study is to create an encrypted electronic recipe application using the Hill Cipher method. This research method generally starts from data collection, data analysis and encryption model development. Applications designed with the Hill Cipher Algorithm are developed with modified algorithm keys using postal code patterns as the matrix keys, this aims to achieve the maximum level of security. The results of the system functionality test using the black box method obtained normal results for all system test scenarios. Validity testing yields valid results. The final test, through questionnaire testing, obtained a good level of system feasibility, namely an average level of Service of 83%, Features of 78% and Performance of 81%. Overall, the system has given a good performance score as the accuracy of the system is above 70%.

Encryption and Description of RGB Values in Images Using the Hill Chiper Algorithm

Information security related to computer use cannot be separated from cryptography. Hill cipher is an application of modulo arithmetic in cryptography. This cryptography technique uses a square matrix as the key used to carry out encryption and decryption. This cryptographic technique was created with the intention of being able to create ciphers (codes) that cannot be broken using frequency analysis techniques. Hill Cipher does not replace each of the same letters in the plaintext with other letters that are the same in the ciphertext because it uses matrix multiplication as a basis for encryption and decryption. Hill Cipher cryptography is a type of classic cryptography that uses a substitution method by providing random keys and the number is the same as the plaintext. The use of encryption and decryption using the Hill cipher algorithm is to help secure data so that it is not easily falsified or accessed by irresponsible people by changing the original image into a different form where the image is not easy to recognize. The encryption and decryption process was designed using the Java programming language using NetBeans 8.2 and the Hill Cipher algorithm to encrypt RGB digital images

Super Encryption of the Hill Cipher Method and the AES Method for Security of Employee Salary Data

Data security is a security system that is needed to protect data in systems, networks and other digital components. In a unit or agency such as the South Binjai sub-district office, the management of employee salary data is done digitally, namely via a computer. However, in this increasingly sophisticated digital era, it can cause many irresponsible individuals to easily wiretapping the company's data so that it can be easily accessed by other parties, as well as employee salary data which contains a lot of data. important. In order to avoid unwanted things such as theft of personal data by irresponsible persons, a security system is needed that can maintain the confidentiality of data and secure data. Therefore, in this case, a security system is needed that can maintain the confidentiality of data and secure employee salary data. With that there are many algorithms that can be used in securing employee salary data. And the algorithm used is hill cipher and AES algorithm. The hill cipher algorithm is an encryption-decryption algorithm that uses a transformation matrix. The AES algorithm is a symmetric block ciphertext that can encrypt and decrypt information. The use of these two algorithms can further strengthen the security of employee salary data. From the results of the trials carried out, the sample data used containing employee salary data was successfully secured with both hill cipher and AES algorithms.

Key analysis of the hill cipher algorithm (Study of literature)

The security of the data (message) sent is very important in maintaining the confidentiality of the message. Many algorithms can be used to secure messages. Among them is the Hill Cipher algorithm. The Hill Cipher algorithm is a classic cryptographic algorithm. This algorithm uses a square matrix key. In connection with the Hill Cipher algorithm key, this literature aims to examine the matrix that can be used as a key in the encryption and decryption process in the Hill Cipher algorithm. In this literature, we take a square matrix of order 3x3 and use 36 characters (A-Z, 0-9). To produce cipher text, the method used is to carry out an encryption process based on the Hill Cipher algorithm. The encryption process is carried out by multiplying the key matrix by the plaintext. The decryption process to get the plain text back is done by multiplying the ciphertext by the inverse modulo matrix of the key matrix. The encryption process can always be carried out, but not all decryption processes can be carried out. Because not all matrices can be used as key matrices. The results of this literature show that the key matrix must be a matrix of order mxm. A matrix with determinant value = 0 cannot be used as a key. Likewise, a matrix whose determinant value is not relatively prime with the number of characters to be encrypted or decrypted cannot be used as a key matrix

Generating Self-Invertible Matrices by Hill Cipher Algorithm In Gaussian Integers

Generating Self-Invertible Matrices by Hill Cipher Algorithm In Gaussian Integers

Cryptographic Security Approach for Biometric Verification System

This paper presents cryptography which is the science of encryption and decryption to protect fingerprint that can be transmitted from sender to receiver. This security approach (cryptography) can also be applicable to other biometric traits like face, iris, retina and palm print. The significant of this protective medium is to prevent intruders or attacker to easily perceive the presence of fingerprint images. The method that was utilized for implementation of this cryptographic security approach for fingerprint verification System was achieved through Elliptic Curve Cryptography and Hill Cipher Algorithm. An elliptic Curve Function was defined and its domain parameters were used to generate self invertible key matrix that was used for the encryption and decryption process of the biometric images (Fingerprint, Face and Ear ) The security approach was also improved by ensuring that the decryption can only be done through secret key. After decryption, fingerprint verification was done by extracting and matching distinct feature (ridges) from template fingerprint and distinct feature from input fingerprint. The result obtained from demonstration of the cryptographic approach allows end users to load fingerprint image, encrypt it at sending end. At receiver end, end user can decrypt the fingerprint image. Image enhancement was later done before authentication through extraction and matching of distinct features. This model will prevent destruction and manipulation of stored fingerprint image. Authentication can also be accomplished through biological traits instead of use of password that can be stolen or transferred to relative.

Message Hiding Using the Least Significant Bit Method with Shifting Hill Cipher Security

Technological developments go hand in hand with advances in digital messaging. In protecting the confidentiality of the message, it is necessary to double secure the data. This security can be done with a combination of steganography and cryptographic techniques. Steganography algorithm which is a technique for hiding messages well, one of which is Least Significant Bit (LSB). The LSB algorithm is a simple method because it only converts the value of the last bit in a message with the inserted message bit, which is a convenience of the LSB algorithm, but it becomes vulnerable to message theft attacks if not combined with other algorithms for security. So it is necessary to increase security. This research developed a combination method of LSB algorithm for steganography technique with Hill Cipher algorithm for cryptographic technique, Hill Cipher was developed with shifting (shifting) 2 (two) characters. With the development of this method, hackers will find it difficult to crack messages, and is expected to improve the performance of the algorithm in affecting image quality and travel time in running the algorithm. The results of this study will be tested using several evaluation tools MSE, PSNR, BER, CER, AE, and Entropy. With the development of this method, hackers will find it difficult to decipher messages, and from the results of this experiment has been able to improve the performance of the algorithm in maintaining image quality and can shorten travel time in running the algorithm.

Modifikasi algoritma Hill cipher dengan matriks kunci berupa matriks ketetanggaan

Cryptography is one of the parts in mathematics, especially applied mathematics. Cryptography is the science that studies how to secure information that we don't want others to know about the information we have. Based on the development of the times, cryptography is divided into two consisting of classical cryptography and modern cryptography. In this paper, the focus of discussion is on classical cryptography. Furthermore, there are many kinds of classical cryptographic algorithms, such as the Caesar cipher algorithm, the Playfair cipher algorithm, the Vigenere cipher algorithm, and the Hill Cipher algorithm. The focus of discussion in this paper is on the Hill cipher algorithm. The modifications made to the Hill cipher algorithm lie in its key matrix. In this paper, it will be shown how to encrypt and decrypt the message we want to send using the Hill cipher algorithm with the matrix being a adjacency matrix. In which case, the adjacency matrix itself is obtained from the representation of the graph. It is hoped that this algorithm can avoid crypt attacks, especially on ciphertext only-attack.Keywords: Hill cipher algorithm, cryptography, adjacency matrix, plaintext, ciphertextMSC2020: 94A60

Design and simulation of secure fiber optic communication system utilizing hill cipher algorithm

Design and simulation of secure fiber optic communication system utilizing hill cipher algorithm

Secure Cluster-based Routing using TCSA and Hybrid Security Algorithm for WSN

Wireless Sensor Network (WSN) is operated as a medium to connect the physical and information network of Internet-of-Things (IoT). Energy and trust are two key factors that assist reliable communication over the WSN-IoT. Secure data transmission is considered a challenging task during multipath routing over the WSN-IoT. To address the aforementioned issue, secure routing is developed over the WSN-IoT. In this paper, the Trust-based Crow Search Algorithm (TCSA) is developed to identify the Secure Cluster Heads (SCHs) and secure paths over the network. Further, data security while broadcasting the data packets is enhanced by developing the Hybrid Security Algorithm (HSA). This HSA is a combination of the Advanced Encryption Standard (AES) and Hill Cipher Algorithm (HCA). Therefore, the developed TCSA-HSA avoids malicious nodes during communication which helps to improve data delivery and energy consumption. The performance of the TCSA-HSA method is analyzed using Packet Delivery Ratio (PDR), Packet Loss Ratio (PLR), energy consumption, End to End Delay (EED), and throughput. The existing methods namely Optimal Privacy-Multihop Dynamic Clustering Routing Protocol (OP-MDCRP) and Secure and Energy-aware Heuristic-based Routing (SEHR) are used to evaluate the TCSA-HSA performances. The PDR of TCSA-HSA for 100 nodes is 99.7449%, which is high when compared to the OP-MDCRP and SEHR.

Enkripsi dan Dekripsi Pesan Menggunakan Polinomial Galois Field dengan Algoritma Hill Cipher

An information is extremely easy to obtain when technology is evolving so fast and it is important to secure the information to avoid irresponsible parties who want to abuse it. Messages that are not safe will harm the owner of the message, therefore a lot of research is related to message security. This study aims to deepen the message security in encoded form using Galois Field polynomials with one of the symmetric encryption algorithms, namely the Hill Cipher algorithm. Encryption is the process of converting a message into a secret code while decryption is the reverse process. The encryption and decryption process in this discussion is carried out by changing the message character into Galois Field polynomial form, then operating calculations based on the Hill Cipher algorithm, and then changing the results of the calculation operations into character form again. Based on the modifications have been made, the encryption and decryption formulas will be multiplied by modulo in polynomials form. In this study, the encryption and decryption keys are in matrix form with elements in it are members of the Galois Field polynomial and the result is a random message of 256 characters in binary bit-8. From this research, we gain insight into the encoding that can be done using polynomials which can be used later in other forms of encoding.

Penggabungan Algoritma Hill Cipher dan ElGamal untuk Mengamankan Pesan teks

Hill Cipher is a one of the symmetric key cryptography algorithm that using an invertible matrix with an order n×n as a key to encrypt and decrypt plaintext. Meanwhile, ElGamal is other asymmetric key cryptography algorithm that use the complexity of discrete logarithms in the encryption and decryption process. In this study, the authors are interest in combine the Hill Cipher and ElGamal algorithms to secure text messages. The author use the matrix as a symmetric key and converts the plaintext in the table of ASCII 256. Then encrypt using the Hill Cipher algorithm which results the ciphertext from messages and ElGamal algorithm results the ciphertext of the symmetric key. In processing decryption using the ElGamal algorithm to determine the symmetric key that will be used as a key in the decryption process with the Hill Cipher algorithm so that the original plaintext is obtained. Then the results obtained are that the combination of the Hill Cipher and ElGamal algorithms to secure text messages can be done it well.

The Hill Cipher Algorithm for Data Encryption and Decryption

The science of encoding and decoding signals is known as cryptography. Cryptography is frequently used in people's daily life to keep sensitive data, such as Mastercard data, safe. Many regular exercises can be easily viewed by unintentional outsiders via the Internet. Hill cipher is a simple linear transformation represented by a matrix that is a traditional cryptography based on linear algebra. It is one of the symmetric key algorithms with various data encryption advantages. However, the inverse of the plaintext encryption key matrix is not always available. The encrypted text cannot be decoded if the key matrix is not invertible. The key matrix employed for encryption in the Involutory matrix generation method is invertible. As a result, we do not need to find the inverse of the key matrix during decryption.

Modified Hill Cipher Algorithm using Myszkowski Transposition to address Known-Plaintext attack

Abstract: Hill Cipher algorithm is a Polygraphic cipher known to be vulnerable to the Known-Plaintext attack. It is a type of attack wherein the attacker has access to a pair of Plaintext and Ciphertext. Possible leaked information can be used to reveal critical data which can include the private key that is used in the encryption of the plaintext. In this study, the researchers propose an improved scheme by incorporating Myszkowski transposition in the algorithm to address the specified problem. Runtime Test and Statistical test such as the Avalanche effect were used to evaluate the performance of the algorithm. The test yielded a 25.70% faster runtime based on previous modifications and a 52.78% Avalanche Effect. Randomness test such as the Monobit test, Runs Test and Longest Run of Ones in a Block test were applied to evaluate the ciphertext produced. The criterion for the Randomness Test requires its p-value to be greater than 0.01, the evaluation showed a 0.249, 0.167 and 0.368 p-value, respectively. The proposed scheme proved that the algorithm is cryptographically secure and efficient as all tests yielded favorable results. Keywords: Cryptography, Hill Cipher, Encryption, Decryption, Key Generation

Hybrid Image Encryption Using Elliptic Curve Cryptography, Hadamard Transform and Hill Cipher

In this digital world, communication systems have witnessed abundant usage of media over the platforms. Among these, providing security in transmission of images is highly important, and attained a lot of research interest due to its high consideration in both the industry and the academic community. This paper proposes a hybrid asymmetric image encryption algorithm using Elliptic curve cryptosystem (ECC), Hadamard transform and Hill cipher algorithms. Based on the Diffie–Hellman public key exchange method a point on the elliptic curve is selected and agreed between both the sender and receiver. The key relies upon the ECC and it is difficult to resolve the ECDLP to get it. The proposed algorithm involves two stages of encryption, primarily, the XOR function is applied on the Elliptic curve Diffie-Hellman (ECDH) shared secret key and the hadamard image. In the subsequent stage, ECC is combined with the hill cipher algorithm. Encryption and decryption uses self-invertible key matrix, hence the process of finding inverse key becomes redundant during decryption which improves the speed of execution. It also enhances the security and efficiency compared to original hill cipher method. The results are compared with other ECC methods proves that the current cryptosystem attains large key space, highly key sensitive, low correlation and can resist against differential and statistical attacks.

Modifikasi Algoritma Kriptografi Hill Chiper dengan Matriks Generalisasi Bilanga Fibonacci dalam Penyandian Pesan

Hill Cipher cryptographic algorithm is a technique of massage encoding by implementing a matrix of order n*n as a key matrix. The key matrix is a matrix that has a multiplicative inverse. The security of messages measured by the number of processes in encoding. More and more processes in the encoding will lead to the longer time required. So that the massage will be safer. The purpose of this research is to modify the Hill Cipher cryptographic algorithm by using the matrix of Fibonacci numbers generalization whose degree-p and rank-n Qn,p. The Matrix Qn,p is a matrix of order(p+1)*(p+1) and it will be the key matrix in the Hill Cipher cryptographic algorithm.This research showed that any matrix of Fibonacci number generalization Qn,p with p and n are positive integers that be used as a key matrix in the Hill Cipher algorithm. The modification of the Hill Cipher cryptographic algorithm has done with modifying the keys by making the degree (p) and rank (n) of Qn,p as the keys that used in the encryption and decryption process of data (message).

Optimization of Hill Cipher Method for Encryption and Decryption of Prescription Drugs at Puskesmas Twano Jayapura City

A drug prescription is a written request from a doctor to a pharmacist that must be kept secret because it contains certain doses of drugs and types of drugs that cannot be known by just anyone, especially those who are not interested. From time to time technological advances have a rapid impact on all sectors, both private and government agencies, including the health sector. One form of service in the health sector that can utilize information technology is the manufacture of electronic drug prescriptions that can be sent via an application from a doctor to a pharmacist. The frequent misuse of prescription drugs by unauthorized persons, as well as errors by officers at the pharmacy in reading prescriptions can be fatal for the community, so a solution is needed to overcome this problem. This application is designed using the Hill Cipher Algorithm which is one of the classic types of algorithms in the field of cryptography, but to get the maximum level of security, the algorithm key will be modified using a postal code pattern as a matrix key. Broadly speaking, the Encryption Stage is the first starting from the plaintext which is the type of drug and drug dose, the second key matrix using a POS code pattern, the three plaintexts are converted into blocks, the fourth is arranged into a 2x2 matrix, the fifth is multiplied between the key and the sixth plaintext is multiplied into mod 26 to generate an encrypted ciphertext or recipe. The success rate of system functionality testing using the blackbox method is 100%

Image Encryption Using Permutation and Hill Cipher

Encryption is used to securely transmit data in open networks. Each type of data has its own features; therefore different techniques should be used to protect confidential image data from unauthorized access. This paper, has been proposed new encryption algorithm using two different images, one is cover image which acts as key image which is shared by both sender and receiver and other is Informative image. As first step, XOR cover image with informative image to obtain resultant image. The resultant image is decomposed into (n x n) blocks which passed to the Hill Cipher algorithm to form encrypted blocks. The encrypted blocks are transformed into new locations using permutation table.

Mixed Hill Cipher methods with triple pass protocol methods

Hill Cipher is a reimbursement coding system that converts specific textual content codes into numbers and does no longer exchange the location of fixed symbols. The symbol modifications simplest in step with the English letter table inclusive of (26) characters handiest. An encoded Hill Cipher algorithm was used that multiplication the square matrix of the apparent text with a non-public key and then combined it with the Triple Pass Protocol method used to repeat the encryption three times without relying on a personal key. Also, you could decode the code and go back it to the express textual content. The cause of mixing algorithms is to cozy the message without any key change among the sender and the recipient.