A signed graph S is a graph G in which every edge x carries a value \(s\left( x \right) \in \left\{ { + 1, - 1} \right\}\) called its sign denoted by \(S = \left( {G,s} \right)\) . Encryption and Decryption techniques are used to keep private information safe in the digital era. Signed graphs are very useful to make a strong and secure cryptographic system. A new way of using signed graphs is introduced to encrypt and decrypt the data. The method involves turning plain text into signed graph representations. Then, signed graphs are used in a graph-based encryption and decryption process. In this paper, signed graph basic ideas, algorithms, and security are defined. The signed graph-based solution is shown to be effective and efficient by doing a lot of experiments and comparing it to other encryption methods. The results show that this new technique has the potential to be a useful addition to the world of encryption and decoding methods.