Get started
Author

Kritsanapong Somsuk

Observed name: Somsuk, Kritsanapong
ORCID: 0000-0002-1311-8222
Observed ORCID: 0000-0002-1311-8222
OpenAlex ID: A5024312018
Authentication system for e-certificate by using RSA’s digital signature
2020 · Kritsanapong Somsuk, Mongkhon Thakong · TELKOMNIKA (Telecommunication Computing Electronics and Control) · 24
An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time
2017 · Kritsanapong Somsuk, Kitt Tientanopajai · International journal of network security · 20
The improvement of initial value closer to the target for Fermat’s factorization algorithm
2018 · Kritsanapong Somsuk · Journal of Discrete Mathematical Sciences and Cryptography · 17
The new integer factorization algorithm based on Fermat’s Factorization Algorithm and Euler’s theorem
2020 · Kritsanapong Somsuk · International Journal of Electrical and Computer Engineering (IJECE) · 16
PDF
The improving decryption process of RSA by choosing new private key
2016 · Kritsanapong Somsuk · 14
An Efficient Variant of Pollard’s p − 1 for the Case That All Prime Factors of the p − 1 in B-Smooth
2022 · Kritsanapong Somsuk · Symmetry · 12
PDF
The Optimal Equations with Chinese Remainder Theorem for RSA’s Decryption Process
2023 · Kritsanapong Somsuk, Sarutte Atsawaraungsuk, et al. · Journal of Wireless Mobile Networks Ubiquitous Computing and Dependable Applications · 11
PDF
The Improvement of Elliptic Curve Factorization Method to Recover RSA’s Prime Factors
2021 · Kritsanapong Somsuk · Symmetry · 11
PDF
A New Methodology to Find Private Key of RSA Based on Euler Totient Function
2021 · Kritsanapong Somsuk · Baghdad Science Journal · 10
PDF
Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops
2019 · Kritsanapong Somsuk, Thanapat Chiawchanwattana, et al. · International Joint Conference on Computer Science and Software Engineering · 10
MFFV2 and MNQSV2: Improved Factorization Algorithms
2013 · Kritsanapong Somsuk, Sumonta Kasemvilas · International Conference on Information Science and Applications · 10
The New Equation for RSA's Decryption Process Appropriate with High Private Key Exponent
2017 · Kritsanapong Somsuk · International Computer Science and Engineering Conference · 9
The special algorithm based on RSA cryptography for signing and verifying digital signature
2025 · Kritsanapong Somsuk · Heliyon · 8
The development of signing and verification methods for high speed digital signatures on electronic official documents by using RSA cryptography
2024 · Kritsanapong Somsuk · Cogent Engineering · 8
PDF
MVFactor: A method to decrease processing time for factorization algorithm
2013 · Kritsanapong Somsuk, Sumonta Kasemvilas · International Computer Science and Engineering Conference · 8
Improving fermat factorization algorithm by dividing modulus into three forms
2016 · Kritsanapong Somsuk, Tientanopajai, Kitt · Engineering and Applied Science Research · 7
PDF
The Variant of Digital Signature Algorithm for Constant Message
2023 · Kritsanapong Somsuk, Sarutte Atsawaraungsuk, et al. · Journal of Internet Services and Information Security · 6
PDF
The alternative Method to Finish Modular Exponentiation and Point Multiplication Processes
2021 · Kritsanapong Somsuk · KSII Transactions on Internet and Information Systems · 5
PDF
Speed up RSA’s Decryption Process with Large sub Exponents using Improved CRT
2018 · Kritsanapong Somsuk, Thanapat Chiawchanwattana, et al. · 5
The New Modified Methodology to Solve ECDLP Based on Brute Force Attack
2018 · Kritsanapong Somsuk, Chalida Sanemueang · Advances in intelligent systems and computing · 5
MFFV3: An Improved Integer Factorization Algorithm to Increase Computation Speed
2014 · Kritsanapong Somsuk, Sumonta Kasemvilas · Advanced materials research · 5
The Improved Estimation of the Least Upper Bound to Search for RSA’s Private key
2022 · Kritsanapong Somsuk · KSII Transactions on Internet and Information Systems · 4
PDF
Applying d-RSA with login system to speed up decryption process in client side
2017 · Kritsanapong Somsuk, Nopparat Thammawongsa · IEEE International Conference on Engineering Technologies and Social Sciences (ICETSS) · 4
A new modified integer factorization algorithm using integer modulo 20's technique
2014 · Kritsanapong Somsuk · International Computer Science and Engineering Conference · 4
Possible Prime Modified Fermat Factorization: New Improved Integer Factorization to Decrease Computation Time for Breaking RSA
2014 · Kritsanapong Somsuk, Sumonta Kasemvilas · Advances in intelligent systems and computing · 4
Works count: 59
Citation count: 262
H-index: 10
I10-index: 11
Year
Topic
Type