In order to speed up long integer modular multiplication and modular exponentiation computations that play the most important role of implementing public-key cryptographic systems, recently a result has been reported by developing a binary complement base
