New approach for efficiently computing factors of the RSA modulus

DOI10.1201/9781003138341-11-11MaRDI QIDQ5163571zbMATH OpenOpenAlexFDO

Authors Muhammad Rezal Kamel Ariffin, Amir Hamzah Ghafar Ghafar Abd, Wan Nur Aqlili Wan Mohd Ruzai, Nurul Nur Hanisah Adenan

Publication date 4 November 2021

Published in Soft Computing Approach for Mathematical Modeling of Engineering Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1201/9781003138341-11-11

zbMATH Keywords

Jochemsz-May strategyRSA cryptosystem

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• New Attacks on the RSA Cryptosystem
• Successful cryptanalytic attacks upon RSA moduli N=pq
• New finding on factoring prime power RSA modulus \(N = {p^r}q\)
• New Attacks on RSA with Moduli N = p r q
• A generalized attack on RSA type cryptosystems

Cited in

(5)

• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
• Methods for Reducing Approximate-Factorization Errors in Two- and Three-Factored Schemes
• Attacking RSA using an arbitrary parameter
• Successful cryptanalytic attacks upon RSA moduli N=pq
• New vulnerability of RSA modulus type \(N = p^2 q\)

This page was built for publication: New approach for efficiently computing factors of the RSA modulus

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