A more complete cryptanalysis of the RSA-polynomial problem
- 20 February 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1070
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (62002335)
- Ningbo Municipal Bureau of Science and Technology (2023QL007)
- China Scholarship Council (202308330390)
This publication has 19 references indexed in Scilit:
- Revisiting RSA-polynomial problem and semiprime factorizationTheoretical Computer Science, 2024
- Partial prime factor exposure attacks on some RSA variantsTheoretical Computer Science, 2024
- Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponentsTheoretical Computer Science, 2020
- Partial key exposure attacks on RSA: Achieving the Boneh–Durfee boundTheoretical Computer Science, 2019
- Generalized cryptanalysis of RSA with small public exponentScience China Information Sciences, 2016
- Breaking RSA May Be As Difficult As FactoringJournal of Cryptology, 2014
- Cryptanalysis of RSA with Small Prime DifferenceApplicable Algebra in Engineering, Communication and Computing, 2002
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Cryptanalysis of short RSA secret exponentsIEEE Transactions on Information Theory, 1990
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982