Hybrid Message-Embedded Cipher Using Logistic Map
Mina Mishra, V. H. Mankar
Abstract
Open-access reader
Mina Mishra, V. H. Mankar
Abstract
Open-access reader
The proposed hybrid message embedded scheme consists of hill cipher combined with message embedded chaotic scheme. Message-embedded scheme using non-linear feedback shift register as non-linear function and 1-D logistic map as chaotic map is modified, analyzed and tested for avalanche property and strength against known plaintext attack and brute-force attack. Parameter of logistic map acts as a secret key. As we know that the minimum key space to resist brute-force attack is 2100, and it is observed from analysis that key space of the discussed method is lesser than 2100. But the identifiability test concludes that the scheme consists of identifiable keys which are sufficient condition to resist brute-force attack for chaotic ciphers. A complete file can be encrypted and decrypted successfully by the method that assures security against brute force attack. It is also concluded that the scheme has an average key sensitivity.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The proposed hybrid message embedded scheme consists of hill cipher combined with message embedded chaotic scheme. Message-embedded scheme using non-linear feedback shift register as non-linear function and 1-D logistic map as chaotic map is modified, analyzed and tested for avalanche property and strength against known plaintext attack and brute-force attack. Parameter of logistic map acts as a secret key. As we know that the minimum key space to resist brute-force attack is 2100, and it is observed from analysis that key space of the discussed method is lesser than 2100. But the identifiability test concludes that the scheme consists of identifiable keys which are sufficient condition to resist brute-force attack for chaotic ciphers. A complete file can be encrypted and decrypted successfully by the method that assures security against brute force attack. It is also concluded that the scheme has an average key sensitivity.
Key concepts: Brute-force attack, Key space, Computer science, Logistic map, Cryptanalysis, Chaotic, Key (lock), Encryption