The improved algorithm to limit scope for recovering private key in Multi-Prime RSA by utilizing Quantum Fourier Transform

References

• Diffie, W., & Hellman, M. (1976). New directions in cryptography. IEEE Transactions on Information Theory, 22(6), 644–654. https://doi.org/10.1109/TIT.1976.1055638
   Web of Science ®Google Scholar
• Fortunato, D., Campos, J., & Abreu, R. (2022). Mutation testing of quantum programs: A case study qith qiskit. IEEE Transactions on Quantum Engineering, 3, 1–17. https://doi.org/10.1109/TQE.2022.3195061
   Google Scholar
• Hamdi, S. M., Zuhori, S. T., Mahmud, F., & Pal, B. (2014). A compare between Shor’s quantum factoring algorithm and general number field sieve. Proceedings of International Conference on Electrical Engineering and Information & Communication Technology, April 10–12, 2014 (pp. 1–6). IEEE.
   Google Scholar
• Harrow, A. W., Hassidim, A., & Lloyd, S. (2009). Quantum algorithm for linear systems of equations. Physical Review Letters, 103(15), 150502. https://doi.org/10.1103/PhysRevLett.103.150502
   PubMed Web of Science ®Google Scholar
• Kulkarni, A., & Kaushik, B. K. (2019). Spin-torque-based quantum Fourier transform. IEEE Transactions on Magnetics, 55(11), 1–8. https://doi.org/10.1109/TMAG.2019.2931278
   Web of Science ®Google Scholar
• Lenstra, A. K., Lenstra, H. W., Jr., & Lovász, L. (1982). Factoring polynomials with rational coefficients. Mathematische Annalen, 261(4), 515–534. https://doi.org/10.1007/BF01457454
   Web of Science ®Google Scholar
• Majumdar, R., & Sur-Kolay, S. (2020). Special session: Quantum error correction in near term systems. Proceedings of International Conference on Computer Design, October 18–20, 2020 (pp. 9–12). IEEE.
   Google Scholar
• McKee, J. (1999). Speeding Fermat’s factoring method. Mathematics of Computation, 68(228), 1729–1737. https://doi.org/10.1090/S0025-5718-99-01133-3
   Web of Science ®Google Scholar
• Mounica, G. R., Manimaran, G., Jerome, L. B., & Bhattacharjee, P. (2021). Implementation of 5-qubit approach-based Shor’s algorithm in IBM qiskit. Proceedings of IEEE Pune Section International Conference (PuneCon), December 16–19, 2021 (pp. 1–6). IEEE.
   Google Scholar
• Nidhi, L., Anurag, P., & Shishupal, K. (2014). Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption. Proceedings of the International Conference on Contemporary Computing and Informatics, November 27–29, 2014 (pp. 992–995). IEEE.
   Google Scholar
• Paar, C., & Pelzl, J. (2010). Understanding cryptography: A textbook for students and practitioners. Springer Science & Business Media.
   Google Scholar
• Pollard, J. M. (1974). Theorems on factorization and primality testing. Mathematical Proceedings of the Cambridge Philosophical Society, 76(3), 521–528. https://doi.org/10.1017/S0305004100049252
   Google Scholar
• Pollard, J. M. (1978). Monte Carlo methods for index computation (mod p). Mathematics of Computation, 32(143), 918–924. https://doi.org/10.1090/S0025-5718-1978-0491431-9
   Web of Science ®Google Scholar
• Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120–126. https://doi.org/10.1145/359340.359342
   Web of Science ®Google Scholar
• Rocca, P., Tosi, L., Anselmi, N., & Massa, A. (2022). On the use of quantum Fourier transform for array antenna analysis. Proceedings of IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting, July 10–15, 2022 (pp. 699–700). IEEE.
   Google Scholar
• Shor, P. W. (1994). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the Annual Symposium on Foundations of Computer Science, November 20–22, 1994 (pp. 124–134). IEEE.
   Google Scholar
• Somsuk, K. (2018). The improvement of initial value closer to the target for Fermat’s factorization algorithm. Journal of Discrete Mathematical Sciences and Cryptography, 21(7–8), 1573–1580. https://doi.org/10.1080/09720529.2018.1502737
   Web of Science ®Google Scholar
• Somsuk, K. (2021). A new methodology to find private key of RSA based on Euler totient function. Baghdad Science Journal, 18(2), 0338. https://doi.org/10.21123/bsj.2021.18.2.0338
   Web of Science ®Google Scholar
• Somsuk, K. (2022). The improved estimation of the least upper bound to search for RSA’s private key. KSII Transactions on Internet and Information Systems, 16(6), 2074–2093. https://doi.org/10.3837/tiis.2022.06.016
   Web of Science ®Google Scholar
• Somsuk, K., & Thakong, M. (2020). Authentication system for e-certificate by using RSA’s digital signature. TELKOMNIKA (Telecommunication Computing Electronics and Control), 18(6), 2948–2955. https://doi.org/10.12928/telkomnika.v18i6.17278
   Google Scholar
• Somsuk, K., & Tientanopajai, K. (2017). An improvement of Fermat’s factorization by considering the last m digits of modulus to decrease computation time. International Journal of Network Security, 19(1), 99–111. https://doi.org/10.6633/IJNS.201701.19(1).11
   Google Scholar
• Song, D., He, C., Cao, Z., & Chai, G. (2018). Quantum teleportation of multiple qubits based on quantum Fourier transform. IEEE Communications Letters, 22(12), 2427–2430. https://doi.org/10.1109/LCOMM.2018.2874025
   Web of Science ®Google Scholar
• Tahir, R. R. M., Asbullah, M. A., Ariffin, M. R. K., & Mahad, Z. (2021). Determination of a good indicator for estimated prime factor and its modification in Fermat’s factoring algorithm. Symmetry, 13(5), 735. https://doi.org/10.3390/sym13050735
   Google Scholar
• Vishwakarma, S., & Gupta, N. K. (2021). An efficient color image security technique for IOT using fast RSA encryption technique. Proceedings of IEEE International Conference on Communication Systems and Network Technologies, June 18–19, 2021 (pp. 717–722). IEEE.
   Google Scholar
• Wahab, O. F. A., Khalaf, A. A. M., Hussein, A. I., & Hamed, H. F. A. (2021). Hiding data using efficient combination of RSA cryptography, and compression steganography techniques. IEEE Access, 9, 31805–31815. https://doi.org/10.1109/ACCESS.2021.3060317
   Web of Science ®Google Scholar
• Wang, J., Chen, H., & Li, Z. (2007). The study of simulation technique of quantum compute and quantum Fourier transform. Proceedings of International Conference on Computer Supported Cooperative Work in Design, April 26–28, 2020 (pp. 1111–1115). IEEE.
   Google Scholar
• Wu, M. E., Tso, R., & Sun, H. M. (2014). On the improvement of Fermat factorization using a continued fraction technique. Future Generation Computer Systems, 30(1), 162–168. https://doi.org/10.1016/j.future.2013.06.008
   Google Scholar
• Yang, T., Zhang, Y., Xiao, S., & Zhao, Y. (2021). Digital signature based on ISRSAC. China Communications, 18(1), 161–168. https://doi.org/10.23919/JCC.2021.01.014
   Web of Science ®Google Scholar
• Zhang, W., Xu, C., Li, F., & Feng, J. (2007). A period-finding method for Shor’s algorithm. Proceedings of International Conference on Computational Intelligence and Security (pp. 778–780). IEEE.
   Google Scholar