Chandra Segar Thirumalai*et al. /International Journal of Pharmacy & Technology IJPT| Dec-2016 | Vol. 8 | Issue No.4 | 4907-4916 Page 4907 ISSN: 0975-766X CODEN: IJPTFI Available Online through Review Article www.ijptonline.com REVIEW ON THE MEMORY EFFICIENT RSA VARIANTS Chandra Segar Thirumalai* School of Information Technology and Engineering, VIT University, Vellore – 632014. Email: chandru01@gmail.com Received on 12-09-2016 Accepted on: 02-11-2016 Abstract Public key cryptography (PKC) plays the phenomenal role in asymmetric based security applications such as E-mail, File sharing, Cloud storage, etc. As like in std. RSAet. al [11], Dual RSA scheme et. al [6] has public code   1 2 , , ENN and private code   1 2 1 2 ,, , , drrss . In this paper Trivial RSA is realized with   1 2 3 , , , EN N N and   1 2 3 1 2 3 ,, , , , , Drrrss s codes which essentially satisfies the condition 1 1 2 2 3 3 1 1 1 ED z N z N z N          . Here 1 2 1 2 , , , a a bb interrelated keys are used to generate primes 1 2 3, 1 2 3 , , , , rr rs s s which takes 2 1 z b  and 3 2 z b  . The strength of keys are tested using lattice constraint 0.33 d n n  . Keywords: Trivial PKC, Lattice, RSA, PKC, Encryption, Decryption I. Introduction Cryptosystem is one of the oldest and finest techniques for data security and information hiding. Now days RSA PKC is widely used for many security based applications. But, by using quantum cryptography, the keys of Std. RSA might get broken down around 850 bits. These result in the need for the enhancement in current PKC cryptosystem. Some of the variants of RSAet. al [1,2,5,6,8,12,13,14,19,22,28]are proposed to meet this demand. Dual RSA is one such variant of RSA in which two keys can be generated with sharing N moduli and this saves the memory requirements of the key storage. Here, in our Trival RSA, three keys are generated at same time in KGS (Key Generation System) phase, which primarily aims to reduce the generation time and also to strengthen the keys by using lattice method. The strength of these keys can be analysed by using lattice constraint 0.33 d n n  . From which only the strong keys will be shared among users there by makes the system unbreakable.