A !ew Efficient Asymmetric Cryptosystem for large data sets

M. R. K.  Ariffin; M. A.  Asbullah; N. A.  Abu

Paper 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.

Note: None

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Hope to be submitted
Keywords: Diophantine equation hard problem (DEHP)integer factorization problem asymmetric cryptography
Contact author(s): rezal @ putra upm edu my
History: 2012-06-20: last of 62 revisions; 2011-08-29: received; See all versions
Short URL: https://ia.cr/2011/467
License: CC BY

BibTeX

@misc{cryptoeprint:2011/467,
      author = {M. R. K.  Ariffin and M. A.  Asbullah and N. A.  Abu},
      title = {A !ew Efficient Asymmetric Cryptosystem for large data sets},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/467},
      year = {2011},
      url = {https://eprint.iacr.org/2011/467}
}