On using Pollard’s p-1 Algorithm to Factor RPrime RSA Modulus

Maya Silvi Lydia, Mohammad Andri Budiman, Dian Rachmawati

2018

Abstract

RPrime RSA is a variant of RSA public key algorithm that uses the multiplication of two or more prime numbers to construct its modulus. The larger the prime numbers are being used, the better the security of the RPrime RSA becomes. Thus, the security of RPrime RSA depends on the hardness of factoring one big integer into its prime factors. In this study, we attempt to factorize the modulus of RPrime RSA using a modified version of Pollard’s p-1 algorithm, an exact algorithm used to factor an integer into its factors. The modified version of Pollard’s p-1 algorithm makes use of Fermat’s algorithm in order to make sure that all of the factors are primes. The results show that the correlation between RPrime RSA modulus and the factoring time is directly proportional, but the value of RPrime RSA modulus does not always reflect the number of iterations the Pollard’s p-1 algorithm is going through.

Paper Citation

in Harvard Style

Lydia M., Budiman M. and Rachmawati D. (2018). On using Pollard’s p-1 Algorithm to Factor RPrime RSA Modulus.In Proceedings of the International Conference of Science, Technology, Engineering, Environmental and Ramification Researches - Volume 1: ICOSTEERR, ISBN 978-989-758-449-7, pages 1895-1899. DOI: 10.5220/0010083618951899

in Bibtex Style

@conference{icosteerr18,
author={Maya Silvi Lydia and Mohammad Andri Budiman and Dian Rachmawati},
title={On using Pollard’s p-1 Algorithm to Factor RPrime RSA Modulus},
booktitle={Proceedings of the International Conference of Science, Technology, Engineering, Environmental and Ramification Researches - Volume 1: ICOSTEERR,},
year={2018},
pages={1895-1899},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010083618951899},
isbn={978-989-758-449-7},
}

in EndNote Style

TY - CONF

JO - Proceedings of the International Conference of Science, Technology, Engineering, Environmental and Ramification Researches - Volume 1: ICOSTEERR,
TI - On using Pollard’s p-1 Algorithm to Factor RPrime RSA Modulus
SN - 978-989-758-449-7
AU - Lydia M.
AU - Budiman M.
AU - Rachmawati D.
PY - 2018
SP - 1895
EP - 1899
DO - 10.5220/0010083618951899