THRESHOLD Φ (n) 2 ? Φ(N) - RSA ALGORITHM

Today Computers are used in various data processing applications ranging from ordinary to sensitive. These Applications should ensure security to customers who perform online payments throug h e - commerce and companies share confidential documents between them. The solution is by Cryptography which provides security to the data such as by Asymmetric key cryptography, also called as Public Key cryptography, uses two different keys (which forms a key pair), one key is used for encryption and only the other corresponding key must be used for decryption. No other key can decrypt the message ? not even the original (i.e. the first) key used for encryption. Many cryptosystems has been proposed with mo difications to original RSA by improving security, performance of various phases of algorithm. In this paper we propose Threshold | φ (n)2 ? φ(N) - RSA Algorithm to provide hierarchy implementation of encryption and decryption phases which has better performance than RSA and its variants like Batch - RSA, Multi - Prime RSA, Rebalanced ? RSA.