Fast decryption method for a Rabin primitive-based cryptosystem

QR Code

Fast decryption method for a Rabin primitive-based cryptosystem

The Chinese Remainder Theorem (CRT) is an algorithm for solving linear congruence system into a unique representation and has been a useful tool in applications of cryptography. For real-world practicality, Garner’s algorithm is efficient to speed up the CRT computation. Recently, a cryptosystem bas...

Full description

Bibliographic Details
Main Authors:	Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal
Format:	Article
Language:	English
Published:	Advanced Institute of Convergence Information Technology 2014
Online Access:	http://psasir.upm.edu.my/id/eprint/37655/ http://psasir.upm.edu.my/id/eprint/37655/1/Fast%20decryption%20method%20for%20a%20Rabin%20primitive-based%20cryptosystem.pdf

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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 and analysis of Rabin-p key encapsulation mechanism for CyberSecurity Malaysia MySEAL initiative
by: Asbullah, Muhammad Asyraf, et al.
Published: (2019)

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)

A new efficient Rabin-like signature scheme
by: Mahad, Zahari, et al.
Published: (2016)

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

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)

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

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

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

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

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

A security upgrade on the GGH lattice-based cryptosystem
by: Arif Mandangan,, et al.
Published: (2020)

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

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

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

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 comparative analysis against RSA and ECC
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2012)

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

Security Study and Encryption / Decryption Method
by: Al-Qdah, Majdi Taysir
Published: (2000)

Modified Baptista type cryptosystem via matrix secret key.
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2008)

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 of Rabin-p and HIME(R) encryption scheme on IoT platform
by: Abd Nashir, Abdul Muhaimin, et al.
Published: (2020)

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

Conditions for counter measure against one time pad attack on Baptista type cryptosystem
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2009)

Rounding theorem the possibility of applying cryptosystem on the decimal numbers.
by: Alfaris, Rand, et al.
Published: (2008)