Factoring RSA moduli with primes sharing bits in the middle

DOI10.1007/s00200-017-0340-0zbMath1391.11158OpenAlexW2747443385MaRDI QIDQ1647745

Omar Khadir, Omar Akchiche

Publication date: 26 June 2018

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-017-0340-0

zbMATH Keywords

public key cryptographyCoppersmith's methodinteger factorization problemRSA system

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (1)

Generalized attack on ECDSA: known bits in arbitrary positions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Cryptanalysis of short RSA secret exponents
• Small Private-Exponent Attack on RSA with Primes Sharing Bits
• On the Improvement of the BDF Attack on LSBS-RSA
• Efficient Factoring Based on Partial Information
• A monte carlo method for factorization
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• On factoring large numbers
• Cryptanalysis of RSA with private key d less than N/sup 0.292/
• Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits

This page was built for publication: Factoring RSA moduli with primes sharing bits in the middle