Citation
Wan Mohd Ruzai, Wan Nur Aqlili and Adenan, Nurul Nur Hanisah and Kamel Ariffin, Muhammad Rezal and Abd Ghafar, Amir Hamzah and Mohamat Johari, Mohamat Aidil
(2021)
An attack on N = p2q with partially known bits on the multiple of the prime factors.
Malaysian Journal of Mathematical Sciences, 15 (spec.1).
63 - 75.
ISSN 1823-8343
Abstract
This paper presents a cryptanalytic study upon the modulus N = p 2q consisting of two large primes that are in the same-bit size. In this work, we show that the modulus N is factorable if e satisfies the Diophantine equation of the form ed − k(N − (ap)2 − apbq + ap) = 1 where ab is an unknown approximation of qp. Our attack is feasible when some amount of Least Significant Bits (LSBs) of ap and bq is known. By utilising the Jochemsz-May strategy as our main method, we manage to prove that the modulus N can be factored in polynomial time under certain specified conditions.
Download File
Full text not available from this repository.
Official URL or Download Paper: https://einspem.upm.edu.my/journal
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science Institute for Mathematical Research |
| Publisher: | Universiti Putra Malaysia |
| Keywords: | Partial-key exposure attack; Integer factorization problem; Jochemsz-May strategy; Least significant bits |
| Depositing User: | Ms. Nuraida Ibrahim |
| Date Deposited: | 03 Apr 2023 07:35 |
| Last Modified: | 03 Apr 2023 07:35 |
| URI: | http://psasir.upm.edu.my/id/eprint/95820 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |