Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference14 articles.
1. D. Aggarwal, U. Maurer, Breaking RSA generically is equivalent to factoring, in A. Joux, editor, Advances in Cryptology—EUROCRYPT 2009, Number 5479 in LNCS (IACR, Springer, Berlin, 2009), pp. 36–53.
2. D. Boneh, Twenty years of attacks on the RSA cryptosystem. Not. Am. Math. Soc.
46(2), 203–213 (1999).
http://crypto.stanford.edu/~dabo/abstracts/RSAattack-survey.html
.
3. D. Boneh, R. Venkatesan, Breaking RSA may be easier than factoring, in Nyberg [10], pp. 59–71.
http://crypto.stanford.edu/~dabo/abstracts/no_rsa_red.html
.
4. J.-S. Coron, A. May, Deterministic polynomial-time equivalence of computing the RSA secret key and factoring. J. Cryptol.
20(1), 39–50 (2007)
5. I. Damgård, M. Koprowski, Generic lower bounds for root extraction and signature schemes in general groups, in L. Knudsen, editor, Advances in Cryptology—EUROCRYPT 2002, Number 2332 in LNCS (IACR, Springer, Berlin), pp. 256–271
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献