Cover Image

Extending Pollard class of factorable RSA modulus

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 show...

Full description

Saved in:
Bibliographic Details
Main Authors: Abd Ghafar, Amir Hamzah, Kamel Ariffin, Muhammad Rezal, Asbullah, Muhammad Asyraf
Format: Conference or Workshop Item
Language:English
Published: Institute for Mathematical Research, Universiti Putra Malaysia 2018
Online Access:http://psasir.upm.edu.my/id/eprint/66533/1/Cryptology2018-5.pdf
http://psasir.upm.edu.my/id/eprint/66533/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.66533
record_format eprints
spelling my.upm.eprints.665332019-03-03T23:58:07Z http://psasir.upm.edu.my/id/eprint/66533/ Extending Pollard class of factorable RSA modulus Abd Ghafar, Amir Hamzah Kamel Ariffin, Muhammad Rezal Asbullah, Muhammad Asyraf 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. Institute for Mathematical Research, Universiti Putra Malaysia 2018 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/66533/1/Cryptology2018-5.pdf 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).
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description 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.
format Conference or Workshop Item
author Abd Ghafar, Amir Hamzah
Kamel Ariffin, Muhammad Rezal
Asbullah, Muhammad Asyraf
spellingShingle Abd Ghafar, Amir Hamzah
Kamel Ariffin, Muhammad Rezal
Asbullah, Muhammad Asyraf
Extending Pollard class of factorable RSA modulus
author_facet Abd Ghafar, Amir Hamzah
Kamel Ariffin, Muhammad Rezal
Asbullah, Muhammad Asyraf
author_sort Abd Ghafar, Amir Hamzah
title Extending Pollard class of factorable RSA modulus
title_short Extending Pollard class of factorable RSA modulus
title_full Extending Pollard class of factorable RSA modulus
title_fullStr Extending Pollard class of factorable RSA modulus
title_full_unstemmed Extending Pollard class of factorable RSA modulus
title_sort extending pollard class of factorable rsa modulus
publisher Institute for Mathematical Research, Universiti Putra Malaysia
publishDate 2018
url http://psasir.upm.edu.my/id/eprint/66533/1/Cryptology2018-5.pdf
http://psasir.upm.edu.my/id/eprint/66533/
_version_ 1643838635081990144
score 13.211869

Similar Items