Secure Hill Cipher Modification Based on Generalized Permutation Matrix SHC-GPM

Abstract

Secure Hill cipher (SHC) modification based on dynamically changing generalized permutation matrix, SHC-GPM is proposed. It provides better security than that of SHC due to the significantly larger number of non-repeatedly generated keys ( 48 2 times greater for the parameters used in the conducted experiments). SHC-GPM is shown to be robust against the brute-force, statistical attacks, and is resistant also to known plaintext ciphertext attack (KPCA) due to dynamic encryption key matrix generating. The proposed modification is applied for colour images encryption. Experimental results show that the proposed modification is significantly more effective in the encryption quality of bitmap images than SHC in the case of images with large single colour areas and slightly more effective otherwise.

A Hybrid Cryptosystem Using Variable Length Sub Key Groups and Byte Substitution

“…It thwarts the knownplaintext attack but their scheme is not efficient and is vulnerable to the chosen-cipher text attack and is proved in Toorani and Falahati (2009;2011) and improved the security with one-way hash function but Keliher and Delaney ( 2013) proved that it is still vulnerable to attacks. Mahmoud and Chefranov (2009;2012;2014) improved the algorithm by using eigen values but these are not efficient and too many seeds are exchanged. Reddy et al (2012a;2012b) improved the Hill cipher by generating session key using oneway function but the time complexity is more.…”

Hybrid approach of image encryption using DNA cryptography and TF Hill Cipher Algorithm

“…Keliher and Delaney (2013) proved that TFHill it is also vulnerable to attacks [13]. Mahmoud and Chefranov (2009;2012;2014) improved the security by using eigen values but these are not efficient because too many seeds are exchanged [14 15 16]. Reddy et al (2012a;2012b) improved the Hill cipher by generating session key using one way hash function but the time complexity is more [17].…”

Secure Hill cipher modifications and key exchange protocol

“…HCM-PRE is more secure than HCM-NPT and HCM-EE because of the significantly larger number of dynamic keys for practically used cipher parameters. In [11], a modification of HCM-PT/HCM-NPT denoted as SHC-GPM was proposed; it uses a generalized permutation matrix (GPM) each row and column of which has all zero entries excepting only one entry co-prime to N. It provides better security than that of HCM-PT and HCM-NPT due to the significantly larger number of non-repeatedly generated keys.…”

“…In[11], we propose a modification of HCM-PT, denoted as SHC-GPM. The SHC-GPM uses a generalized permutation matrix (GPM), t M , each row and column of which has all zero entries excepting only one entry co-prime to N, i.…”