Citation
Abd Ghafar, Amir Hamzah and Kamel Ariffin, Muhammad Rezal and Asbullah, Muhammad Asyraf
(2018)
Extending Pollard class of factorable RSA modulus.
In: 6th International Cryptology and Information Security Conference 2018 (CRYPTOLOGY2018), 9-11 July 2018, Port Dickson, Negeri Sembilan, Malaysia. (pp. 103-118).
Abstract
Pollard p − 1 method is able to solve integer factorization problem if the targeted composite number has small prime factors. This is a reason why implementation in key generation algorithm of RSA cryptosystem requires its primes, p and q not to be constituted by small primes. In this paper, we showed another method which targets N = pq and manipulates it against p − 1 and q − 1 structures. We remarked here that both p − 1 and q − 1 do not have small prime factors hence they can be generated without error by RSA libraries in current practice.
Download File
|
![[img]](http://psasir.upm.edu.my/style/images/fileicons/text.png)
Additional Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculty of Science Institute for Mathematical Research Centre of Foundation Studies for Agricultural Science |
| Publisher: | Institute for Mathematical Research, Universiti Putra Malaysia |
| Keywords: | Integer factorization problem; RSA cryptosystem; Pollard p − 1 algorithm |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 03 Mar 2019 23:58 |
| Last Modified: | 03 Mar 2019 23:58 |
| URI: | http://psasir.upm.edu.my/id/eprint/66533 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |