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

DOI10.1515/gcc-2016-0002zbMath1401.11158OpenAlexW2322455926MaRDI QIDQ285897

Omar Khadir, Omar Akchiche

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

public key cryptographyCoppersmith's theoreminteger factorization problemmulti-power RSA

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Uses Software

• ESIGN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
• The development of the number field sieve
• Factoring integers with elliptic curves
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Cryptanalysis of RSA with small prime difference
• On the security of RSA with primes sharing least-significant bits
• Mathematics of Public Key Cryptography
• A monte carlo method for factorization
• A method for obtaining digital signatures and public-key cryptosystems
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
• Small Secret Key Attack on a Variant of RSA (Due to Takagi)
• Public Key Cryptography – PKC 2004

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