Abstract
We propose an algorithm that, given an arbitrary N of unknown factorization and prime e ≥ N1/4+ε, certifies whether the RSA function RSAN,e(x): = xe mod N defines a permutation over ℤN* or not. The algorithm uses Coppersmith's method to find small solutions of polynomial equations and runs in time O(ε-8 log2 N). Previous certification techniques required e > N. © International Association for Cryptologic Research 2012.
Author supplied keywords
Cite
CITATION STYLE
Kakvi, S. A., Kiltz, E., & May, A. (2012). Certifying RSA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7658 LNCS, pp. 404–414). https://doi.org/10.1007/978-3-642-34961-4_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
