Multiple CLMMs Keys to Secure Message Transmission

Abstract

A simple, flexible and efficient method of message cryptography will be introduced. The method will suit any message with any length, it can use one or more rounds to apply encryption-decryption. The PK key will have a complicated structure that cannot be hacked. The PK will contain information about chaotic parameters, these parameters will be used to run a CLMMs to generate the needed number of CLKs, the generated CLKs will be converted to induces keys, which are to be used as a lockup tables in the encryption and decryption phases. The generated key will sensitive to any minor changes in the PK, and using another PK in the decryption phase will produce a damaged decrypted message. The method will be implemented and the obtained results will be used to calculate the method throughput. The obtained throughputs will be compared with DES method throughput to show how the proposed method speedup the process of message cryptography.

A secure fingerprint hiding technique based on DNA sequence and mathematical function

“…Table 1 provides a summary of key information from several techniques, considering factors such as the number of security layers, encryption functions used, and steganography methods employed. Various encryption techniques have been employed, including XOR operation, complement rule, shift operation, LBP operation, MSB and LSB values, 2-bit or 4-bit DNA conversion, Keccak, Feistel network, amino acid–based methods, AES, RSA, ElGamal, Paillier, and Payfair cipher techniques ( Siddaramappa & Ramesh, 2015 ; Srilatha & Murali, 2016 ; Mavanai et al, 2019 ; Niu et al, 2019 ; Biswas et al , 2019 ; Hamed et al, 2018 ). Additionally, various techniques have been used for the hiding process, such as least significant bit (LSB), most significant bit (MSB), knight tour, ambiguity bits, lsbase, and adjacent base techniques ( Nie et al, 2019 ; Msallam, 2020 ; Sajisha & Mathew, 2017 ).…”