New simultaneous Diophantine attacks on generalized RSA key equations

QR Code

New simultaneous Diophantine attacks on generalized RSA key equations

RSA stands as a widely adopted method within asymmetric cryptography, commonly applied for digital signature validation and message encryption. The security of RSA relies on the challenge of integer factorization, a problem considered either computationally infeasible or highly intricate, especially...

Full description

Bibliographic Details
Main Authors:	Ruzai, Wan Nur Aqlili, Ariffin, Muhammad Rezal Kamel, Asbullah, Muhammad Asyraf, Abd Ghafar, Amir Hamzah
Format:	Article
Language:	English
Published:	King Saud bin Abdulaziz University 2024
Online Access:	http://psasir.upm.edu.my/id/eprint/113455/ http://psasir.upm.edu.my/id/eprint/113455/1/113455.pdf

Similar Items

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)

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

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

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

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

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

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

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

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

Extending Pollard class of factorable RSA modulus
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2018)

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

The diophantine equation hard problem (DEHP) as an asymmetric primitive - is it possible?
by: Kamel Ariffin, Muhammad Rezal
Published: (2013)

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

On the Diophantine equation
by: Zahari, N. M., et al.
Published: (2012)

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

An efficient identification scheme in standard model based on the diophantine equation hard problem
by: Tea, Boon Chian, et al.
Published: (2013)

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

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

Cryptanalysis of RSA and its variants using continuous midpoint subdivision analysis and lattices
by: Wan Mohd Ruzai, Wan Nur Aqlili
Published: (2021)

Timing attack analysis on AAβ cryptosystem
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2014)

On the diophantine equation x² + 4.7ᵇ = y²ʳ
by: Yow, Kai Siong, et al.
Published: (2013)

On the integral solutions of the diophantine equation x4 + y4 = z3
by: Ismail, S., et al.
Published: (2013)

Bound on some Diophantine equation
by: Amalulhair, N. H., et al.
Published: (2022)

An attack on N = p2q with partially known bits on the multiple of the prime factors
by: Wan Mohd Ruzai, Wan Nur Aqlili, et al.
Published: (2021)

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

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

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

The Blömer-May’s weak key revisited
by: Mohd Tahir, Rasyid Redha, et al.
Published: (2019)

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

On the exponential diophantine equations of degree three
by: Amalul Hair, Nur Hidayah, et al.
Published: (2019)

On the diophantine equation Px + Qy = z²
by: Japar, Izzati Izyani, et al.
Published: (2024)

SPA on Rabin variant with public key N= p2q
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2016)

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

Design and analysis of Rabin-p key encapsulation mechanism for CyberSecurity Malaysia MySEAL initiative
by: Asbullah, Muhammad Asyraf, et al.
Published: (2019)

Gaussian integer solutions of the Diophantine equation x⁴ + y⁴ = z³ for x‰ y
by: Ismail, Shahrina, et al.
Published: (2023)

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

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

On the diophantine equation p ͯ +qᵐnᵞ = z²
by: Bakar, Halimatun Saadiah
Published: (2018)

Enhancement of RSA Key Generation Using Identity
by: Norhidayah, Muhammad, et al.
Published: (2015)