| The improvement of initial value closer to the target for Fermat’s factorization algorithm K Somsuk Journal of Discrete Mathematical Sciences and Cryptography 21 (7-8), 1573-1580, 2018 | 22 | 2018 |
| An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time. K Somsuk, K Tientanopajai Int. J. Netw. Secur. 19 (1), 99-111, 2017 | 22 | 2017 |
| Authentication system for e-certificate by using RSA’s digital signature K Somsuk, M Thakong TELKOMNIKA (Telecommunication Computing Electronics and Control) 18 (6 …, 2020 | 17 | 2020 |
| The improving decryption process of RSA by choosing new private key K Somsuk 2016 8th International Conference on Information Technology and Electrical …, 2016 | 15 | 2016 |
| The new integer factorization algorithm based on Fermat’s Factorization Algorithm and Euler’s theorem K Somsuk International Journal of Electrical and Computer Engineering 10 (2), 1469-1476, 2020 | 10 | 2020 |
| Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops K Somsuk, T Chiawchanwattana, C Sanemueang 2019 16th International Joint Conference on Computer Science and Software …, 2019 | 10 | 2019 |
| MFFV2 and MNQSV2: Improved factorization Algorithms K Somsuk, S Kasemvilas 2013 International Conference on Information Science and Applications (ICISA …, 2013 | 10 | 2013 |
| The Improvement of Elliptic Curve Factorization Method to Recover RSA’s Prime Factors K Somsuk Symmetry 13 (8), 1314, 2021 | 9 | 2021 |
| A new methodology to find private key of RSA based on euler totient function K Somsuk Baghdad Science Journal 18 (2), 338-348, 2021 | 9 | 2021 |
| The new modified methodology to solve ECDLP based on brute force attack K Somsuk, C Sanemueang Recent Advances in Information and Communication Technology 2018 …, 2019 | 9 | 2019 |
| Mffv3: An improved integer factorization algorithm to increase computation speed K Somsuk, S Kasemvilas Advanced Materials Research 931, 1432-1436, 2014 | 9 | 2014 |
| The New Equation for RSA's Decryption Process Appropriate with High Private Key Exponent K Somsuk 2017 21st International Computer Science and Engineering Conference (ICSEC), 1-5, 2017 | 8 | 2017 |
| MVFactor: A method to decrease processing time for factorization algorithm K Somsuk, S Kasemvilas 2013 International Computer Science and Engineering Conference (ICSEC), 339-342, 2013 | 8 | 2013 |
| Applying d-RSA with login system to speed up decryption process in client side K Somsuk, N Thammawongsa Engineering Technologies and Social Sciences (ICETSS), 2017 IEEE 3rd …, 2018 | 6 | 2018 |
| An efficient variant of Pollard’sp− 1 for the case that all prime factors of the p− 1 in B-Smooth K Somsuk Symmetry 14 (2), 312, 2022 | 5 | 2022 |
| Improving fermat factorization algorithm by dividing modulus into three forms K Somsuk, K Tientanopajai Engineering and Applied Science Research 43, 350-353, 2016 | 5 | 2016 |
| A new modified integer factorization algorithm using integer modulo 20's technique K Somsuk 2014 International Computer Science and Engineering Conference (ICSEC), 312-316, 2014 | 5 | 2014 |
| Possible prime modified fermat factorization: New improved integer factorization to decrease computation time for breaking rsa K Somsuk, S Kasemvilas Recent Advances in Information and Communication Technology: Proceedings of …, 2014 | 5 | 2014 |
| Speed up RSA’s Decryption Process with Large sub Exponents using Improved CRT K Somsuk, T Chiawchanwattana, C Sanemueang 2018 International Conference on Information Technology (InCIT), 1-5, 2018 | 4 | 2018 |
| MVFactorV2: An improved integer factorization algorithm to speed up computation time K Somsuk 2014 International Computer Science and Engineering Conference (ICSEC), 308-311, 2014 | 3 | 2014 |
