Blockchain is a rapidly developing technology that has been widely known for its high data security features. Although it is mostly utilized to encrypt data in transit, the underlying processes tend to be misinterpreted by the public. In this paper, a new lightweight encryption scheme called CS25-1, inspired by small but secure algorithms like Salsa and RB20, is proposed. CS25-1 employs a six-step encryption and decryption process, designed to render information more secure yet still be effective. The process, also referred to as CS25-1, is thus: Create Two Secret Messages: Begin with the writing of two plaintext messages that are to be encrypted. Encrypt First Message: Each character of the first message is encrypted with a predecided secret code and then multiplied by four to add complexity. Matrix Mapping (First Message): The encrypted values are then placed within a matrix to create structural obfuscation. Encrypt the Second Message: The second message is encrypted using the secret code, followed by multiplication by four. Matrix Mapping (Second Message): The second group of encrypted values is mapped into a second matrix. Prime Key Division: A hidden prime number is employed subsequently to divide the values in each of the two matrices, providing yet another level of cryptographic hardness. The decryption algorithm proceeds to undo the steps in sequence to obtain the original plaintexts. This multi-layered approach enhances conventional encryption strategies by providing double-message encoding, matrix transformation, and prime-based division as collective methods of strengthening against brute-force and analytical attacks. © 2025 Elsevier B.V., All rights reserved.