Factoring multi power RSA moduli with a class of secret exponents

DOI10.1515/ausi-2015-0016zbMath1345.11086OpenAlexW2566239297MaRDI QIDQ907002

Omar Khadir, Omar Akchiche

Publication date: 1 February 2016

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/ausi-2015-0016

zbMATH Keywords

public key cryptographyinteger factorization problemmultipower RSA

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cites Work

• 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
• A monte carlo method for factorization
• A method for obtaining digital signatures and public-key cryptosystems
• On factoring large numbers
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
• Public Key Cryptography – PKC 2004

This page was built for publication: Factoring multi power RSA moduli with a class of secret exponents