Welcome to the resource topic for 2011/467
Title:
A !ew Efficient Asymmetric Cryptosystem for large data sets
Authors: M. R. K. Ariffin, M. A. Asbullah, 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.
ePrint: https://eprint.iacr.org/2011/467
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .