Kritsanapong Somsuk

According to our database, Kritsanapong Somsuk authored at least 18 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2025

An Improved Algorithm for Accelerating Modular Exponentiation with Periodic Bit Pattern Exponents.

Kritsanapong Somsuk, Nirundon Panit, Ravee Phromloungsri

KSII Trans. Internet Inf. Syst., April, 2025

Dynamic Predictive Feedback Mechanism for Intelligent Bandwidth Control in Future SDN Networks.

Kritsanapong Somsuk, Suchart Khummanee, Panida Songram

Network, 2025

Improved Algorithm for Thai Characters to Encryption and Decryption Processes.

Kritsanapong Somsuk, Sarutte Atsawaraungsuk, Chanwit Suwannapong, Suchart Khummanee, Mongkhon Thakong, Chalida Sanemueang, Nuttapong Bootthanu

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2025

Huffman Tree and Binary Conversion for Efficient and Secure Data Encryption and Decryption.

Suchart Khummanee, Thanapat Cheawchanwattana, Chanwit Suwannapong, Sarutte Atsawaraungsuk, Kritsanapong Somsuk

J. Cybersecur. Priv., 2025

Message Group Optimization in Kyber-512 Post-Quantum Cryptography: Comparing Proposed Static Encoding With Huffman Code, Base-64, and ASCII Methods.

Kritsanapong Somsuk

IEEE Access, 2025

2023

The Variant of Digital Signature Algorithm for Constant Message.

Kritsanapong Somsuk, Sarutte Atsawaraungsuk, Chanwit Suwannapong, Suchart Khummanee, Chalida Sanemueang

J. Internet Serv. Inf. Secur., May, 2023

The Optimal Equations with Chinese Remainder Theorem for RSA's Decryption Process.

Kritsanapong Somsuk, Sarutte Atsawaraungsuk, Chanwit Suwannapong, Suchart Khummanee, Chalida Sanemueang

J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl., 2023

2022

An Efficient Variant of Pollard's p - 1 for the Case That All Prime Factors of the p - 1 in B-Smooth.

Kritsanapong Somsuk

Symmetry, 2022

The Improved Estimation of the Least Upper Bound to Search for RSA's Private key.

Kritsanapong Somsuk

KSII Trans. Internet Inf. Syst., 2022

2021

The Improvement of Elliptic Curve Factorization Method to Recover RSA's Prime Factors.

Kritsanapong Somsuk

Symmetry, 2021

The alternative Method to Finish Modular Exponentiation and Point Multiplication Processes.

Kritsanapong Somsuk

KSII Trans. Internet Inf. Syst., 2021

2020

The new Weakness of RSA and The Algorithm to Solve this Problem.

Kritsanapong Somsuk

KSII Trans. Internet Inf. Syst., 2020

Fast Special -Purposed Factoring Algorithm by Using Modular Multiplication.

Kritsanapong Somsuk, Chalida Sanemueang

Proceedings of the 12th International Conference on Knowledge and Smart Technology, 2020

2019

Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops.

Kritsanapong Somsuk, Thanapat Chiawchanwattana, Chalida Sanemueang

Proceedings of the 16th International Joint Conference on Computer Science and Software Engineering, 2019

2017

An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time.

Kritsanapong Somsuk, Kitt Tientanopajai

Int. J. Netw. Secur., 2017

2014

Possible Prime Modified Fermat Factorization: New Improved Integer Factorization to Decrease Computation Time for Breaking RSA.

Kritsanapong Somsuk, Sumonta Kasemvilas

Proceedings of the Recent Advances in Information and Communication Technology, 2014

2013

Comparison Performance of MFFV2 and MVFactor for Factoring the Modulus.

Kritsanapong Somsuk, Sumonta Kasemvilas

Proceedings of the 2013 International Conference on IT Convergence and Security, 2013

MFFV2 and MNQSV2: Improved Factorization Algorithms.

Kritsanapong Somsuk, Sumonta Kasemvilas

Proceedings of the International Conference on Information Science and Applications, 2013