arXiv subjects

Muhammad Rezal Kamel Ariffin

Publications and source records attributed to Muhammad Rezal Kamel Ariffin.

3 recordsLinked to original sources

arXiv2014

Rabin-$p$ Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme

In this work, we introduce a new, efficient and practical scheme based on the Rabin cryptosystem without using the Jacobi symbol, message redundancy technique or the needs of extra bits in order to specify the correct plaintext. Our system involves only a single prime number as the decryption key and does only one modular exponentiation. Consequently, this will practically reduce the computational efforts during decryption process. We demonstrate that the decryption is unique and proven to be equivalent to factoring.The scheme is performs better when compared to a number of Rabin cryptosystem variants.

cs.CR↗

arXiv2013

An asymmetric primitive based on the Bivariate Function Hard Problem

The Bivariate Function Hard Problem (BFHP) has been in existence implicitly in almost all number theoretic based cryptosystems. This work defines the BFHP in a more general setting and produces an efficient asymmetric cryptosystem. The cryptosystem has a complexity order of O(n^2) for both encryption and decryption.

cs.CR↗

arXiv2011

The El-Gamal AA_β Public Key Cryptosystem - A new approach utilizing the subset sum problem in designing an asymmetric cryptosystem

The El-Gamal AA_β Public Key Cryptosystem is a new asymmetric cryptosystem based on the piecewise AA_β-function. The AA_β-function which is essentially a one way Boolean function was motivated by the squaring and multiplying process while computing g^a (mod p) in the Diffie Hellman key exchange procedure and also computing C \equiv M^e (mod N) and M \equiv C^d (mod N) in the RSA cryptosystem. It was also motivated by the add and double point operation E=kG in the elliptic curve cryptosystem. The hard mathematical problem surrounding this newly designed asymmetric cryptosystem is the NP-complete problem known as the subset sum problem. The El-Gamal AA_β Public Key Cryptosystem mimics the El-Gamal Cryptosystem and the Elliptic Curve Cryptosystem by sending a two parameter ciphertext to the recipient.

cs.CR↗