N. A. Abu

activity

20102012

most citedA New Efficient Asymmetric Cryptosystem Based on the Square Root Problem

3 citations · 5 across the 3 of their papers we have counts for

collaborators

Showing cs.CRShow all

2 papers · 1 filter

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 $U = i = 1 \sum n V_{i} x_{i}$ . A proper implementation of DEHP…

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…