Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy
This paper presents a cryptanalytic approach on the variants of the RSA which utilizes the modulus N = p2q where p and q are balanced large primes. Suppose satisfying gcd(e, ϕ(N)) = 1 where ϕ(N) = p(p − 1)(q − 1) and d < Nδ be its multiplicative inverse. From ed − kϕ(N) = 1, by utilizing the ext...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Published: |
Public Library of Science
2021
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/95804/ |
| _version_ | 1848862224926375936 |
|---|---|
| author | Adenan, Nurul Nur Hanisah Kamel Ariffin, Muhammad Rezal Yunos, Faridah Sapar, Siti Hasana Asbullah, Muhammad Asyraf |
| author_facet | Adenan, Nurul Nur Hanisah Kamel Ariffin, Muhammad Rezal Yunos, Faridah Sapar, Siti Hasana Asbullah, Muhammad Asyraf |
| author_sort | Adenan, Nurul Nur Hanisah |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | This paper presents a cryptanalytic approach on the variants of the RSA which utilizes the modulus N = p2q where p and q are balanced large primes. Suppose satisfying gcd(e, ϕ(N)) = 1 where ϕ(N) = p(p − 1)(q − 1) and d < Nδ be its multiplicative inverse. From ed − kϕ(N) = 1, by utilizing the extended strategy of Jochemsz and May, our attack works when the primes share a known amount of Least Significant Bits(LSBs). This is achievable since we obtain the small roots of our specially constructed integer polynomial which leads to the factorization of N. More specifically we show that N can be factored when the bound . Our attack enhances the bound of some former attacks upon N = p2q. |
| first_indexed | 2025-11-15T13:13:38Z |
| format | Article |
| id | upm-95804 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T13:13:38Z |
| publishDate | 2021 |
| publisher | Public Library of Science |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-958042023-03-30T08:00:27Z http://psasir.upm.edu.my/id/eprint/95804/ Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy Adenan, Nurul Nur Hanisah Kamel Ariffin, Muhammad Rezal Yunos, Faridah Sapar, Siti Hasana Asbullah, Muhammad Asyraf This paper presents a cryptanalytic approach on the variants of the RSA which utilizes the modulus N = p2q where p and q are balanced large primes. Suppose satisfying gcd(e, ϕ(N)) = 1 where ϕ(N) = p(p − 1)(q − 1) and d < Nδ be its multiplicative inverse. From ed − kϕ(N) = 1, by utilizing the extended strategy of Jochemsz and May, our attack works when the primes share a known amount of Least Significant Bits(LSBs). This is achievable since we obtain the small roots of our specially constructed integer polynomial which leads to the factorization of N. More specifically we show that N can be factored when the bound . Our attack enhances the bound of some former attacks upon N = p2q. Public Library of Science 2021 Article PeerReviewed Adenan, Nurul Nur Hanisah and Kamel Ariffin, Muhammad Rezal and Yunos, Faridah and Sapar, Siti Hasana and Asbullah, Muhammad Asyraf (2021) Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy. PLoS One, 16 (3). art. no. 024888. pp. 1-11. ISSN 1932-6203 https://journals.plos.org/plosone/article/authors?id=10.1371/journal.pone.0248888 10.1371/journal.pone.0248888 |
| spellingShingle | Adenan, Nurul Nur Hanisah Kamel Ariffin, Muhammad Rezal Yunos, Faridah Sapar, Siti Hasana Asbullah, Muhammad Asyraf Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy |
| title | Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy |
| title_full | Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy |
| title_fullStr | Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy |
| title_full_unstemmed | Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy |
| title_short | Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy |
| title_sort | analytical cryptanalysis upon n = p2q utilizing jochemsz-may strategy |
| url | http://psasir.upm.edu.my/id/eprint/95804/ http://psasir.upm.edu.my/id/eprint/95804/ http://psasir.upm.edu.my/id/eprint/95804/ |