On the security of multi-prime RSA
From MaRDI portal
Publication:3537519
Recommendations
- On the security of distributed multiprime RSA
- scientific article; zbMATH DE number 1951624
- On the security of RSA with primes sharing least-significant bits
- A generalized attack on the multi-prime power RSA
- scientific article; zbMATH DE number 2043333
- Attacks on multi-prime RSA with small prime difference
- Cryptanalysis of multi-prime RSA with small prime difference
- The multi-dimension RSA and its low exponent security
- scientific article; zbMATH DE number 1303967
- scientific article; zbMATH DE number 1418283
Cites work
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of short RSA secret exponents
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
Cited in
(18)- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- An Information Fusion approach based on prime numbers coming from RSA algorithm and Fractals for secure coding
- Attacks on multi-prime RSA with small prime difference
- Improved factoring attacks on multi-prime RSA with small prime difference
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Investigation of an attack on the multi-prime RSA cryptosystem based on cubic equations
- Multiparty generation of an RSA modulus
- The multi-variable modular polynomial and its applications to cryptography
- Exploiting the security of \(N= p^r q^s\) through approximation of \(\varphi(N)\)
- scientific article; zbMATH DE number 1951624 (Why is no real title available?)
- Improved cryptanalysis of the multi-prime \(\varphi\)-hiding assumption
- Optimal bounds for multi-prime \(\Phi \)-hiding assumption
- A tool kit for partial key exposure attacks on RSA
- Common modulus attacks on small private exponent RSA and some fast variants (in practice)
- Cryptanalysis of Dual RSA
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- The multi-dimension RSA and its low exponent security
This page was built for publication: On the security of multi-prime RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537519)
