6 citations · 13 across the 6 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CR2012★ 2 cited
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…
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…