New Approach for Efficiently Computing Factors of the RSA Modulus

DOI10.1201/9781003138341-11-11zbMATH Open1478.94104OpenAlexW4233959646MaRDI QIDQ5163571

Wan Nur Aqlili Wan Mohd Ruzai, Muhammad Rezal Kamel Ariffin, Amir Hamzah Ghafar Ghafar Abd, 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

RSA cryptosystemJochemsz-May strategy

Mathematics Subject Classification ID

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

Related Items (2)

Methods for Reducing Approximate-Factorization Errors in Two- and Three-Factored Schemes ⋮ Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents

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)