3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.IT2012★ 3 cited
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…
cs.CR2010
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…