Factoring multi-power RSA moduli with primes sharing least or most significant bits

DOI10.1515/GCC-2016-0002zbMATHOpenAlexMaRDI QIDQ285897FDO

Authors Omar Akchiche, Omar Khadir

Publication date 19 May 2016

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gcc-2016-0002

zbMATH Keywords

Coppersmith's theoreminteger factorization problemmulti-power RSApublic key cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Recommendations

• Factoring RSA moduli with primes sharing bits in the middle
• Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
• Cryptanalysis of RSA variants with primes sharing most significant bits
• Implicit factorization of unbalanced RSA moduli
• New Attacks on RSA with Moduli N = p r q

Cites work

• scientific article; zbMATH DE number 1583953 (Why is no real title available?)
• scientific article; zbMATH DE number 5306932 (Why is no real title available?)
• scientific article; zbMATH DE number 3959521 (Why is no real title available?)
• scientific article; zbMATH DE number 177609 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 1302856 (Why is no real title available?)
• scientific article; zbMATH DE number 1303131 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• scientific article; zbMATH DE number 1418303 (Why is no real title available?)
• scientific article; zbMATH DE number 2204782 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A monte carlo method for factorization
• Cryptanalysis of RSA with small prime difference
• Factoring integers with elliptic curves
• Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
• Mathematics of public key cryptography.
• On the security of RSA with primes sharing least-significant bits
• Public Key Cryptography – PKC 2004
• Small Secret Key Attack on a Variant of RSA (Due to Takagi)
• Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• The development of the number field sieve
• Using LLL-reduction for solving RSA and factorization problems

Cited in

(7)

• Weak keys in RSA with primes sharing least significant bits
• Cryptanalysis of RSA variants with primes sharing most significant bits
• Implicit Factoring with Shared Most Significant and Middle Bits
• Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
• Factoring RSA moduli with primes sharing bits in the middle
• Factoring RSA modulus using prime reconstruction from random known bits
• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents

Describes a project that uses

Uses Software

• ESIGN

This page was built for publication: Factoring multi-power RSA moduli with primes sharing least or most significant bits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285897)