A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q

QR Code

A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q

In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape N = p2q. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's cryptosystem. Its encryption speed has a...

Full description

Bibliographic Details
Main Authors:	Kamel Ariffin, Muhammad Rezal, Asbullah, Muhammad Asyraf, Abu, Nur Azman, Mahad, Zahari
Format:	Article
Language:	English
Published:	Institute for Mathematical Research, Universiti Putra Malaysia 2013
Online Access:	http://psasir.upm.edu.my/id/eprint/39041/ http://psasir.upm.edu.my/id/eprint/39041/1/39041.pdf

Similar Items

Analysis on the Rabin-p cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

Efficient methods to overcome Rabin cryptosystem decryption failure
by: Mahad, Zahari, et al.
Published: (2017)

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)

AAβ public key cryptosystem - a new practical asymmetric implementation based on the square root problem
by: Mahad, Zahari, et al.
Published: (2012)

AAβ public-key cryptosystem - a practical implementation of the new asymmetric
by: Mahad, Zahari, et al.
Published: (2013)

Enhanced AAβ cryptosystem: the design
by: Asbullah, Muhammad Asyraf, et al.
Published: (2018)

Enhanced AAβ cryptosystem - a comparative analysis
by: Mahad, Zahari, et al.
Published: (2019)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2015)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2014)

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

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

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

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

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

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)

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

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

Security Analysis of a Public Key Cryptosystem for Synchronized Chaotic Systems
by: Mahad, Zahari, et al.
Published: (2022)

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)

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

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

Analytical cryptanalysis upon N = p2q utilizing Jochemsz-May strategy
by: Adenan, Nurul Nur Hanisah, et al.
Published: (2021)

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

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

AAβ-Cryptosystem: a chaos based public key cryptosystem
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2009)

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

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

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

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

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

A failure in decryption process for bivariate polynomial reconstruction problem cryptosystem
by: Yusof, Siti Nabilah, et al.
Published: (2024)

On the smallest-basis problem underlying the GGH lattice-based cryptosystem
by: Mandangan, Arif, et al.
Published: (2019)

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

A new efficient Rabin-like signature scheme
by: Mahad, Zahari, 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)

Another look at the security analysis of the modulus N = p 2 q by utilizing an approximation approach for ϕ(N)
by: Aqlili Ruzai, Wan Nur, et al.
Published: (2024)

New vulnerability on system of Ni = p²iqi using good approximation of Φ(N)
by: Nek Abd Rahman, Normahirah, et al.
Published: (2018)

Performance analysis and improvement of rabin primitive based cryptosystems
by: Mahad, Zahari
Published: (2014)

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