Header menu link for other important links
X
Review on the memory efficient RSA variants
Published in International Journal of Pharmacy and Technology
2016
Volume: 8
   
Issue: 4
Pages: 4907 - 4916
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 (E,N1,N2) and private code (d,r1,r2,s1,s2). In this paper Trivial RSA is realized with (E,N1,N2,N3) and (d,r1,r2,r3,s1,s2,s3) codes which essentially satisfies the condition ED =1+z1ϕN1=1+z2ϕN2=1+z3ϕN3. Here a1,a2,b1,b2interrelated keys are used to generate primes r1, r2,r3,s1, s2, s3which takes z2=b1and z3=b2. The strength of keys are tested using lattice constraint nd< n0.33. © 2016, International Journal of Pharmacy and Technology. All rights reserved.
About the journal
JournalInternational Journal of Pharmacy and Technology
PublisherInternational Journal of Pharmacy and Technology
ISSN0975766X
Open AccessNo