Extending Pollard class of factorable RSA modulus

QR Code

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

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/ http://psasir.upm.edu.my/id/eprint/66533/1/Cryptology2018-5.pdf

Similar Items

New attacks on RSA with modulus N = p2q using continued fractions
by: Asbullah, Muhammad Asyraf, et al.
Published: (2015)

New directions in factoring the prime power RSA modulus N = prq
by: Shehu, Sadiq, et al.
Published: (2016)

New Jochemsz–May Cryptanalytic bound for RSA system utilizing common Modulus N = p2q
by: Adenan, Nurul Nur Hanisah, et al.
Published: (2021)

A new attack on special-structured RSA primes
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2019)

Introducing S-index into factoring RSA modulus via Lucas sequences
by: Abu, Nur Azman, et al.
Published: (2017)

New cryptanalytic attack on RSA modulus N = pq using small prime difference method
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2019)

A new LSB attack on special-structured RSA primes
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2020)

Cryptanalysis on prime power RSA modulus of the form N=prq
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2016)

New vulnerabilities of RSA modulus type N = p²q
by: Nek Abd Rahman, Normahirah, et al.
Published: (2016)

A comparative S-index in factoring RSA modulus via Lucas sequences
by: Abu, Nur Azman, et al.
Published: (2016)

New vulnerability of RSA modulus type N = p2q
by: Nek Abd Rahman, Normahirah, et al.
Published: (2017)

A survey of partial key exposure attacks on RSA cryptosystem
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2019)

New simultaneous Diophantine attacks on generalized RSA key equations
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2024)

Successful cryptanalytic attacks upon RSA moduli N = pq
by: Abubakar, Saidu Isah, et al.
Published: (2019)

On the variants of RSA cryptosystem and its related algebraic cryptanalysis
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2019)

Concurrent factorization of RSA moduli via weak key equations
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2024)

A new simultaneous diophantine attack upon RSA moduli N = pq
by: Abubakar, Saidu Isah, et al.
Published: (2018)

Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis
by: Wan Mohd Ruzai, Wan Nur Aqlili, et al.
Published: (2022)

On (unknowingly) using near-square RSA primes
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2022)

Partial key attack given MSBs of CRT-RSA private keys
by: Abd Ghafar, Amir Hamzah Abd, et al.
Published: (2020)

New compendium of RSA vulnerabilities
by: Abd Ghafar, Amir Hamzah
Published: (2020)

Factoring the modulus of type n = p2q by finding small solutions of the equation er − (ns + t) = αp2 + βq2
by: Asbullah, Muhammad Asyraf, et al.
Published: (2021)

Fast decryption methods for the Somsuk-RSA cryptosystem.
by: Asbullah, Muhammad Asyraf, et al.
Published: (2024)

AAβ public key cryptosystem - a comparative analysis against RSA and ECC
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2012)

New weak findings upon RSA modulo of type N = p2 q
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2016)

Security issues of Novel RSA variant
by: Nitaj, Abderrahmane, et al.
Published: (2022)

Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf
Published: (2015)

An updated cryptanalysis on the BFHP-DLP signing scheme
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2022)

Exponential increment of RSA attack range via lattice based cryptanalysis
by: Nitaj, Abderahmanne, et al.
Published: (2021)

Provably secure Rabin-p cryptosystem in hybrid setting
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

Fast decryption method for a Rabin primitive-based cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2014)

A proposed CCA-secure encryption on an ElGamal variant
by: Asbullah, Muhammad Asyraf, et al.
Published: (2012)

Provably secure randomized AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2015)

Design of Rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2013)

Algebraic cryptanalysis on the AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2017)

Algebraic analysis of a rabin-like cryptosystem and its countermeasures
by: Asbullah, Muhammad Asyraf, et al.
Published: (2017)

Another proof of wiener's short secret exponent
by: Asbullah, Muhammad Asyraf, et al.
Published: (2019)

Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q
by: Asbullah, Muhammad Asyraf, et al.
Published: (2014)

Analysis on the AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)