Get all the updates for this publication
We consider the lossiness of RSA trapdoor permutation studied by Kiltz, O’Neill and Smith in Crypto 2010. In Africacrypt 2011, Herrmann improved the cryptanalytic results of Kiltz et al. In this paper, we improve the bound provided by Herrmann, considering the fact that the unknown variables in the central modular equation of the problem are not balanced. We provide detailed experimental results to justify our claim. It is interesting that in many situations, our experimental results are better than our theoretical predictions. Our idea also extends the weak encryption exponents proposed by Nitaj in Africacrypt 2012.
View more info for "Reduction in lossiness of RSA trapdoor permutation"
Journal | Data powered by TypesetSecurity, Privacy, and Applied Cryptography Engineering |
---|---|
Publisher | Data powered by TypesetSpringer Berlin Heidelberg |
Open Access | No |