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

DOI10.1515/GCC-2016-0002zbMATH Open1401.11158OpenAlexW2322455926MaRDI QIDQ285897FDOQ285897

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

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

zbMATH Keywords

Coppersmith's theoreminteger factorization problemmulti-power RSApublic key cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cites Work

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

Cited In (5)

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

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)