Citation
Kamel Ariffin, Muhammad Rezal
(2013)
The diophantine equation hard problem (DEHP) as an asymmetric primitive - is it possible?
In: International Conference on Mathematical Sciences and Statistics 2013 (ICMSS2013), 5-7 Feb. 2013, Kuala Lumpur, Malaysia. (pp. 31-35).
Abstract
We put forward a probable hard problem based on a Diophantine equation that has characteristics to become an asymmetric primitive. Motivated by rearranging the equation representing the RSA modulus, N together with its Euler-phi function, φ(N) we define the Diophantine Equation Hard Problem (DEHP) on a definitive setting. Relation between the RSA factorization problem, RSA's e-th root problem and the DEHP is also discussed. A proposed asymmetric cryptosystem that manipulates DEHP together with the difficulty of factoring a product of strong primes is presented.
Download File
|
Additional Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculty of Science Institute for Mathematical Research |
| DOI Number: | https://doi.org/10.1063/1.4823869 |
| Publisher: | AIP Publishing LLC |
| Keywords: | Diophantine equation; RSA factorization problem; RSA's e-th root problem |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 26 Sep 2017 03:42 |
| Last Modified: | 26 Sep 2017 03:42 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1063/1.4823869 |
| URI: | http://psasir.upm.edu.my/id/eprint/57211 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |