Advanced Cryptographic Schemes Using Prism Graphs for Secure Data Transmission

Cryptographic techniques combined with Graph labeling make it harder for an opponent to hack the plaintext. Sharing sensitive information without third-party exposure remains a challenge, but cryptography addresses this issue. This study offers brand-new encryption algorithms for protected message transmission using an n-Prism graph and labeling scheme like minimization of even multiplicative labeling and multiplicative lableing. Experimental results confirm the efficiency and security of the proposed Prism Graph-based Encryption Scheme (PGES). The scheme achieves linear time complexity O(n), significantly reducing execution time compared to traditional methods. At n = 40, PGES executes in 0.000208 seconds, while a general graph-based cryptographic system (GCS) requires 0.00740 seconds. Similarly, Cipher graph-based encryption takes 4.0762 seconds at n = 20, making PGES a more efficient alternative for real-time secure communication. Beyond speed, PGES strengthens security against man-in-the-middle and replay attacks, thanks to its structured graph-labeling approach. By integrating multiplicative and minimization of even multiplicative labeling with matrix operations, the scheme provides a lightweight yet powerful encryption framework. These advantages make PGES a practical choice for applications requiring high security and quick processing.