An implementation of the H-rabin algorithm in the shamir three-pass protocol

The Shamir three-pass protocol, which is also called Shamir no key protocol, is a cryptographic protocol that allows two parties to exchange information securely without exchanging any secret keys. In order to operate, a proper algorithm should be implemented in the three-pass protocol. The proper algorithm has to follow commutative-encryption system and has to allow fast computation since there are two encryption and two decryption processes in the three-pass protocol itself that logically take a longer time than a usual one-pass protocol. Meanwhile, there are just a few cryptographic algorithms nowadays that can be implemented in the three-pass protocol to ensure fast encryption, fast decryption, and cryptanalysis-proof. In this research, we study the eligibility of the H-Rabin algorithm, which belongs to the class of public key cryptosystems, as a candidate algorithm for the three-pass protocol. Unlike the well-known RSA and Rabin public key cryptosystems, the H-Rabin's security depends on the hardness of factoring three large prime numbers rather than two. Our study shows that the H-Rabin algorithm is an acceptable algorithm to be implemented the three-pass protocol.