3 citations · 5 across the 4 of their papers we have counts for
4 papers
An asymmetric primitive based on the Bivariate Function Hard Problem
Muhammad Rezal Kamel Ariffin
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…
A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
M. R. K. Ariffin
A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption speed of , thus making it the fastest asymmetri…
A New Efficient Asymmetric Cryptosystem Based on the Square Root Problem
M. R. K. Ariffin, M. A. Asbullah, N. A. Abu
The square root modulo problem is a known primitive in designing an asymmetric cryptosystem. It was first attempted by Rabin. Decryption failure of the Rabin cryptosystem caused by…
The El-Gamal AA_β Public Key Cryptosystem - A new approach utilizing the subset sum problem in designing an asymmetric cryptosystem
Muhammad Rezal Kamel Ariffin, Arif Mandangan, Aniza Abdul Ghani +2
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 w…