Cryptology ePrint Archive: Report 2011/467

A !ew Efficient Asymmetric Cryptosystem for large data sets

M.R.K. Ariffin, M.A. Asbullah and N.A. Abu

Abstract: The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on a Diophantine equation. The DEHP has been in existence for ``worst case scenario" of the RSA, Diffie-Hellman and El-Gammal schemes. However, the DEHP emerges after the exponentiation and modular reduction process. The proposed scheme (known as the $AA_{\beta}$-cryptosystem) is an asymmetric cryptographic scheme that utilizes this concept (without any prior mathematical operation) together with the factorization problem of two large primes. Its encryption speed has a complexity order faster than the Diffie-Hellman Key Exchange, El-Gammal, RSA and ECC. It can encrypt large data sets than its key size. It has a simple mathematical structure. Thus, it would have low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently.

Category / Keywords: Diophantine equation hard problem (DEHP), integer factorization problem, asymmetric cryptography

Publication Info: Hope to be submitted

Date: received 28 Aug 2011, last revised 19 Jun 2012

Contact author: rezal at putra upm edu my

Available format(s): PDF | BibTeX Citation

Note: None

Version: 20120620:030726 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]