Revisiting RSA-polynomial problem and semiprime factorization
From MaRDI portal
Publication:6558638
DOI10.1016/j.tcs.2024.114634MaRDI QIDQ6558638
Publication date: 19 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Breaking RSA may be as difficult as factoring
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- Improved factorization of \(N=p^rq^s\)
- A note on the bivariate Coppersmith theorem
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Implicit Related-Key Factorization Problem on the RSA Cryptosystem
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A method for obtaining digital signatures and public-key cryptosystems
- Breaking RSA may not be equivalent to factoring
- Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
- Advances in Cryptology - EUROCRYPT 2004
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Breaking RSA Generically Is Equivalent to Factoring
- Advances in Cryptology - ASIACRYPT 2003
- A bivariate polynomial-based cryptographic hard problem and its applications
This page was built for publication: Revisiting RSA-polynomial problem and semiprime factorization
