Factoring $$N=p^rq^s$$ for Large r and s-Reference-Cited by-同舟云学术

Factoring $$N=p^rq^s$$ for Large r and s

Published:2016 Issue: Volume: Page:448-464
ISSN:0302-9743
Container-title:Topics in Cryptology - CT-RSA 2016
language:
Short-container-title:

Author:

Coron Jean-Sébastien,Faugère Jean-Charles,Renault Guénaël,Zeitoun Rina

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-29485-8_26

Reference19 articles.

1. Bi, J., Coron, J.-S., Faugère, J.-C., Nguyen, P.Q., Renault, G., Zeitoun, R.: Rounding and chaining lll: finding faster small roots of univariate polynomial congruences. IACR Cryptology ePrint Archive, 2014 (2014)

2. Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$ . IEEE Trans. Inf. Theory 46(4), 1339 (2000)

3. Lecture Notes in Computer Science;D Boneh,1999

4. Lecture Notes in Computer Science;J Blömer,2005

5. Coron, J.-S., Faugere, J.-C., Renault, G., Zeitoun, R.: Factoring $${N}=p^r q^s$$ for large $$r$$ and $$s$$ . Cryptology ePrint Archive, Report 2015/071 (2015). http://eprint.iacr.org/ . Full version of this paper

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving Generalized Bivariate Integer Equations and Its Application to Factoring With Known Bits;IEEE Access;2023

2. Partial Key Exposure Attacks on RSA with Moduli N=p^rq^s;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26

3. New Results of Breaking the CLS Scheme from ACM-CCS 2014;Information and Communications Security;2022

4. A Generalized Attack on the Multi-prime Power RSA;Progress in Cryptology - AFRICACRYPT 2022;2022

5. Deterministic factoring with oracles;Applicable Algebra in Engineering, Communication and Computing;2021-09-16