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. © 2012 Springer-Verlag.
CITATION STYLE
Sarkar, S. (2012). Reduction in lossiness of RSA trapdoor permutation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7644 LNCS, pp. 144–152). https://doi.org/10.1007/978-3-642-34416-9_10
Mendeley helps you to discover research relevant for your work.