A more complete cryptanalysis of the RSA-polynomial problem
From MaRDI portal
Cites work
- A bivariate polynomial-based cryptographic hard problem and its applications
- A method for obtaining digital signatures and public-key cryptosystems
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Advances in Cryptology - CRYPTO 2003
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
- Better lattice constructions for solving multivariate linear equations modulo unknown divisors
- Breaking RSA Generically Is Equivalent to Factoring
- Breaking RSA Generically Is Equivalent to Factoring
- Breaking RSA may be as difficult as factoring
- Breaking RSA may not be equivalent to factoring
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Cryptanalysis of RSA with small prime difference
- Cryptanalysis of short RSA secret exponents
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Factoring integers with elliptic curves
- Factoring polynomials with rational coefficients
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- scientific article; zbMATH DE number 1024053 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 1852133 (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 factoring attacks on multi-prime RSA with small prime difference
- Improved factorization of \(N=p^rq^s\)
- Lattice-based integer factorisation: an introduction to Coppersmith's method
- Optimal bounds for multi-prime -hiding assumption
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Partial prime factor exposure attacks on some RSA variants
- Revisiting modular inversion hidden number problem and its applications
- Revisiting RSA-polynomial problem and semiprime factorization
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Solving linear equations modulo unknown divisors: revisited
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Using LLL-reduction for solving RSA and factorization problems
This page was built for publication: A more complete cryptanalysis of the RSA-polynomial problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6841371)
