Revisiting RSA-polynomial problem and semiprime factorization
From MaRDI portal
Recommendations
- A bivariate polynomial-based cryptographic hard problem and its applications
- Cryptanalysis of the RSA variant based on cubic Pell equation
- A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA
- Factorizing RSA keys, an improved analogue solution
- An attack on N = p^2q with partially known bits on the multiple of the prime factors
Cites work
- A bivariate polynomial-based cryptographic hard problem and its applications
- A method for obtaining digital signatures and public-key cryptosystems
- A note on the bivariate Coppersmith theorem
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Advances in Cryptology - EUROCRYPT 2004
- Breaking RSA Generically Is Equivalent to Factoring
- Breaking RSA may be as difficult as factoring
- Breaking RSA may not be equivalent to factoring
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Factoring multi-power RSA modulus N = p^r q with partial known bits
- Factoring polynomials with rational coefficients
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- scientific article; zbMATH DE number 1722670 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1418303 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Implicit related-key factorization problem on the RSA cryptosystem
- Improved factorization of \(N=p^rq^s\)
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
This page was built for publication: Revisiting RSA-polynomial problem and semiprime factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558638)
