6 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.CR2014★ 6 cited
Rabin- Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme
Muhammad Asyraf Asbullah, Muhammad Rezal Kamel Ariffin
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…
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.CR2011★ 2 cited
Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Hard Problem
M. R. K. Ariffin, M. A. Asbullah, N. A. Abu
The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on the Diophantine equation . A proper implementation of DEHP…