Open Access
Research Article
Increasing security to public key cryptography for point-to-point communication
*Kritsanapong SomsukCorresponding authorkritsanapong@udru.ac.thDepartment of Computer and Communication EngineeringFaculty of TechnologyUdon Thani 41000Udon Thani Rajabhat University, UDRUThailand0000-0002-7264-4628View full profile → , Chalida SanemueangChalida.sa@udru.ac.thOffice of Academic Resources and Information TechnologyUdon Thani 41000Udon Thani Rajabhat University, UDRUThailandView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 31 Oct 2020
- Accepted:
- 30 Apr 2021
- Published Online:
- 15 Nov 2021
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-1353
- Pages:
- 215–229
Abstract
In the beginning of 2020, the new idea of public key cryptography was proposed. This method is from the combining between RSA and Chebyshev maps. It is very difficult to break this system because it is based on both of Integer Factorization Problem (IFP) and Chaotic maps Discrete Logarithm Problem (CMDL). However, Chebyshev polynomials taking many computation costs (many modular multiplications and modular subtraction operations) are the equation to find the result of Chebyshev maps. In this paper, the new improvement of public-key cryptography is proposed for point-to-point communication. The main key is to reduce time and increase the security level. In fact, time is reduced by replacing some Chebyshev maps with modular exponentiation equations using only modular multiplication processes. In addition, the security level can be increased, because it is based on three problems, IFP, CMDL and Discrete Logarithm Problem (DLP). Although, DLP is included in the proposed method, it does not affect the computation time in both of encryption and decryption sides, because DLP is selected to exchange the RSA's public key. The experimental results show that time can be reduced in both sides especially in decryption side. The reason is that the private key of the compared method must be assigned too large, it is larger than the traditional RSA's private key. On the other hand, the private key for the proposed method is similar to RSA's private key.
Keywords
Subject Classifications
94A6000A6968M25
References
- S. Kanoje, D. Mukhopadhyay and S. Girase, “User Profiling for University Recommender System using Automatic Information Retrieval”, Procedia Computer Science, vol.78, pp. 5–12, 2016. doi: https://doi.org/10.1016/j.procs.2016.02.002 [Crossref], [Google Scholar]
- L. Li, J. Fang, J. Jiang, L. Gan, W. Zheng, H. Fu and G. Yang, “Efficient AES implementation on Sunway TaihuLight supercomputer: A systematic approach”, Journal of Parallel and Distributed Computing, vol.138, pp.178–189, 2020. doi: https://doi.org/10.1016/j.jpdc.2019.12.013 [Crossref], [Web of Science ®], [Google Scholar]
- D. Gerault, P. Lafourcade, M. Minier and C. Solnon, “Computing AES related-key differential characteristics with con-straint programming”, Artificial Intelligence, vol. 278, pp.1–32, 2020. doi: https://doi.org/10.1016/j.artint.2019.103183 [Crossref], [Web of Science ®], [Google Scholar]
- W. Diffie and M.E. Hellman, “New directions in cryptography”, IEEE Transactions on Information Theory, vol. 22, pp. 644–654, 1976. doi: https://doi.org/10.1109/TIT.1976.1055638 [Crossref], [Web of Science ®], [Google Scholar]
- R.L. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems”, Communications of ACM, vol. 21, pp. 120–126, 1978. doi: https://doi.org/10.1145/359340.359342 [Crossref], [Web of Science ®], [Google Scholar]
- K. Somsuk, “The improvement of initial value closer to the target for Fermat's factorization algorithm”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 21(7–8), pp. 1573–1580, 2018. doi: https://doi.org/10.1080/09720529.2018.1502737 [Taylor & Francis Online], [Web of Science ®], [Google Scholar]
- K. Somsuk and K. Tientanopajai, “An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time”, International Journal of Network Security, vol. 19, pp. 99–111, 2017. [Google Scholar]
- M.E. Wu, R. Tso and H.M. Sun, “On the improvement of Fermat factorization using a continued fraction technique”, Future Generation Computer Systems vol. 30(1), pp.162–168, 2014. doi: https://doi.org/10.1016/j.future.2013.06.008 [Crossref], [Google Scholar]
- G. Pandey, “Polynomial selection in number field sieve for integer factorization”, Perspectives in Science, vol. 8, pp. 101–103, 2016. doi: https://doi.org/10.1016/j.pisc.2016.04.007 [Crossref], [Google Scholar]
- N. Tahat, A. A. Tahat, M. Abu-Dalu, R.B. Albadarneh, A.E. Abdallah and O.M. Al-Hazaimeh, “A new RSA public key encryption scheme with chaotic maps”, International Journal of Electrical and Computer Engineering, vol. 10(2), pp.1430–1437, 2020. [Google Scholar]
- J .A. Buchman, "Introduction to Cryptography", Springer-Verlag, Germany, 2004. [Google Scholar]
- O. Nibouche, M. Nibouche and A. Bouridane, "Highspeed FPGA implementation of RSA encryption algorithm", in: Proc. International Conference on Electronics, Circuits and Systems, 2003, pp. 204-207. [Google Scholar]
- K. Somsuk, "The improving decryption process of RSA by choosing new private key", in: Proc. International Conference on Information Technology and Electrical Engineering, 2016, pp. 1–4. [Crossref], [Google Scholar]
- D. Arroyo, G. Alvarez, S. Li, C. Li and J. Nunez, “Cryptanalysis of a discrete-time synchronous chaotic encryption system”, Physics Letters A, vol. 372(7), pp. 1034–1039, 2008. doi: https://doi.org/10.1016/j.physleta.2007.08.066
Views: 236Downloads: 98Citations: 2
