MESSAGE BINARY MATRIX ROTATING TO PROTECT SECRET MESSAGE

Recently, in today’s interconnected digital world, the transmission of both lengthy and concise secret messages
is ubiquitous across diverse communication platforms. With the proliferation of sensitive and specialized
information being exchanged, safeguarding these messages from potential threats such as intruders, abusers, and
data hackers becomes imperative and vital issue. This paper research presents an innovative approach aimed at
streamlining message protection procedures while concurrently thwarting hacking attempts. At the core of the
presented method lies the utilization of a sophisticated variable content private key designed to facilitate ease of
alteration without compromising the integrity of encryption and decryption operations. The pivotal aspect
involves leveraging the use of a private key to run a simple chaotic logistic map model to generate the secret
key, mandating both the sender and receiver to securely retain this key. By employing selected chaotic
parameters values, the secret key can seamlessly adapt to match the length of the confidential message. To
fortify the level of security, the message is recommended to convert to binary to get the message binary matrix,
and the rows of this matrix will be treated as blocks. Subsequently, the bits within each block are consolidated
into a singular vector, which undergoes a left rotation by a predetermined number of bits as specified by
generated secret key. The presented methodology is empirically validated through the implementation of various
secret text messages. Comparative analyses against existing methods underscore the efficacy and robustness of
the proposed approach, substantiating its significant advancements in data protection paradigms.