Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure

QR Code

Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure

Rabin cryptosystem has fast encryption and proven as secure as the integer factorization problem. Nonetheless, its decryption produces four possible correct results with no indicator for choosing the right one is given. Therefore, this scenario leads to a decryption failure. In order to engage with...

Full description

Bibliographic Details
Main Author:	Asbullah, Muhammad Asyraf
Format:	Thesis
Language:	English
Published:	2015
Subjects:	Cryptography Mathematics
Online Access:	http://psasir.upm.edu.my/id/eprint/58664/ http://psasir.upm.edu.my/id/eprint/58664/1/IPM%202015%209IR.pdf

Similar Items

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

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

Cryptanalysis of polynomial reconstruction problem based cryptosystems
by: Yusof, Siti Nabilah
Published: (2023)

Cryptanalysis of El-Gamal AAs cryptosystem
by: Mandangan, Arif
Published: (2011)

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

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)

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

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

Factorization strategies of N = pq and N = pʳq and relation to its decryption exponent bound
by: Abubakar, Saidu Isah
Published: (2018)

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

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

Extention and cryptanalysis of golden cryptography
by: Sharabyan, Mohammad Tahghighi
Published: (2015)

The Fourth Order Linear Recurrence Sequence For RSA Type Cryptosystem
by: Wong, Tze Jin
Published: (2006)

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

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

Reconstructing applicable chaotic Baptista-type symmetric cryptosystem
by: Daud, Muhamad Azlan
Published: (2014)

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

Improved Algebraic Cryptanalysis of the Reduced-Round Advanced Encryption Standard
by: Rezaeipour, Davood
Published: (2011)

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

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

A RSA-type cryptosystem based on quartic polynomials
by: Wong, Tze Jin
Published: (2011)

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

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

On the Improvement of Addition Chain in Applications to Elliptic Curve Cryptosystem Status: Submitted
by: Mohamed, Mohamad Afendee
Published: (2011)

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

A New "F-Lueg" Cryptosystem and its Security
by: Choo, Mun Yoong
Published: (2002)

Side channel analysis on AAᵝ cryptosystem and a signing scheme based on bivariate function hard problem and discrete logarithm problem
by: Abd Ghafar, Amir Hamzah
Published: (2015)

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)

Enhancement of {0, 1, 3}-NAF Recoding Algorithm using Block Method Technique for Elliptic Curve Cryptosystem
by: Bafandehkar, Mohsen
Published: (2015)

A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2013)

Nonlinearity analyses and adaptation of nonlinearity traits of key generation protocol of el-gamal AAß cryptosystem
by: Ahmad, Miza Mumtaz
Published: (2011)

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

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)

Rabin-p encryption scheme analysis on MQTT
by: Che Izam, Wan Abdullah, et al.
Published: (2023)

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

A new class of efficient piecewise nonlinear chaotic maps for secure cryptosystems
by: Li, Y., et al.
Published: (2009)

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

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

Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
by: Al-Saffar, Najlae Falah Hameed
Published: (2015)