Abstract
In the context of modern digital communication, securing information exchange is increasingly critical, particularly against evolving threats in cryptanalysis. This research investigates the security aspects of the three-pass protocol based on permutations, focusing on identifying and mitigating potential vulnerabilities. The study proposes a set of guidelines for ensuring secure communication through this protocol. The protocol’s robustness against brute-force attacks is analyzed and compared with other well-known cryptographic protocols, such as the Shamir three-pass protocol and the MasseyOmura cryptosystem. The results highlight the importance of key length and permutation structure in maintaining security, particularly when dealing with large key spaces. Additionally, the practical implications of implementing this protocol in real-time communication systems, considering the computational demands and potential optimizations are explored.