A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem of N =P2=Q

In this paper,we introduce a new scheme based on the hardness of factoring integers of the shape n =p2=q. our scheme uses a combination of modular linear and modular squaring. we show that the decryption is 1-to-1 which is a great advantage over rabin's cryptosystem. its encryption speed has a complexity order faster than rsa and ecc. for decryption its speed is better than rsa and is marginally behind ecc. constructed using a simple mathematical structure,it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently.