Kritsanapong Somsuk

Dr. Kritsanapong Somsuk

Department of Computer and Communication Engineering, Faculty of Technology, Udon Thani Rajabhat University,UDRU, Udon Thani, Thailand
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2020 in TELKOMNIKA (Telecommunication Computing Electronics and Control)
Verified
Journal Article
Open access
PDF file
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
MTMongkhon Thakong
Mongkhon Thakong
Authentication system for e-certificate by using RSA’s digital signature

17 November 2018 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
Integer Factorization Algorithm is one of the hard problems for breaking RSA. Fermat’s Factorization Algorithm (FFA) factoring the modulus very fast whenever the difference between two large prime factors is very small is a type of integer factorization algorithms. Generally, the initial values are far from the targets which are perfect square numbers. Although the new initial values closer to the targets in comparison to the originals were proposed, the method is called Estimated Prime Factor (EPF), they can be applied with only unbalanced modulus. In this paper, the new methodology for estimating one of initial values is proposed. In deep, it is closer to the target when it is compared with the original and it can be applied with all values of the modulus. The experimental results show that the new initial value can be larger when the size of the modulus is higher. In fact, it is based on the size of the modulus and also the distance between the original initial value and the possible target which is the closest to the original initial value. Furthermore, it implies that loops computation can be decreased especially the large size of the modulus because the new initial value is always very larger than the traditional.

3 February 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
Due to the computational limitations at present, there is no efficient integer factorization algorithm that can break at least 2048 bits of RSA with strong prime factors in polynomial time. Although Shor’s algorithm based on a quantum computer has been presented, the quantum computer is still in its early stages of the development. As a result, the integer factorization problem (IFP) is a technique that is still being refined. Pollard’s p − 1 is an integer factorization algorithm based on all prime factors of p − 1 or q − 1, where p and q are two distinct prime factors of modulus. In fact, Pollard’s p − 1 is an efficient method when all prime factors of p − 1 or q − 1 are small. The aim of this paper is to propose a variant of Pollard’s p − 1 in order to decrease the computation time. In general, the proposed method is very efficient when all prime factors of p − 1 or q − 1 are the members of B-smooth. Assuming this condition exists, the experimental results demonstrate that the proposed method is approximately 80 to 90 percent faster than Pollard’s p − 1. Furthermore, the proposed technique is still faster than Pollard’s p − 1 for some values of modulus in which at least one integer is a prime factor of p − 1 or q − 1 while it is not a member of B-smooth. In addition, it is demonstrated that the proposed method’s best-case running time is O(x),where x is represented as bits length of n.

1 October 2016
Verified
Conference Paper
Closed access
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
RSA is the best well - known and the most widely used of public key cryptosystem. The advantage of this algorithm is that the senders who have the public key and the receivers who have private key can communicate each other via the unsecured channel secretly. However, the processes of RSA have to take very great computation cost especially in the decryption process. In this paper, the improving decryption process of RSA, is called New Private Key of RSA (d-RSA), is proposed to reduce the computation cost of the decryption process. The key is to find the new private key, which has low Hamming weight while the values of public key and modulus are not changed. With the low Hamming weight, it implies that the computation cost of decryption process of d-RSA is certainly reduced when compared with the same process which has the higher Hamming weight in RSA. Furthermore, it implies that not only the private key which is the inverse of public key modulo Euler function but also the other keys that can decrypt the ciphertext. In addition, with reducing computation cost, the proposed method is the better choice when low power devices are chosen to decrypt the ciphertext.

1 April 2020 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
PDF file
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
Although, Integer Factorization is one of the hard problems to break RSA, many factoring techniques are still developed. Fermat’s Factorization Algorithm (FFA) which has very high performance when prime factors are close to each other is a type of integer factorization algorithms. In fact, there are two ways to implement FFA. The first is called FFA-1, it is a process to find the integer from square root computing. Because this operation takes high computation cost, it consumes high computation time to find the result. The other method is called FFA-2 which is the different technique to find prime factors. Although the computation loops are quite large, there is no square root computing that included into the computation. In this paper, the new efficient factorization algorithm is introduced. Euler’s theorem is chosen to apply with FFA to find the addition result between two prime factors. The advantage of the proposed method is that almost of square root operations are left out from the computation while loops are not increased, they are equal to the first method. Therefore, if the proposed method is compared with the FFA-1, it implies that the computation time is decreased, because there is no the square root operation and the loops are same. On the other hand, the loops of the proposed method are less than the second method. Therefore, time is also reduced. Furthermore, the proposed method can be also selected to apply with many methods which are modified from FFA to decrease more cost.

21 July 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
Elliptic Curve Factorization Method (ECM) is the general-purpose factoring method used in the digital computer era. It is based on the medium length of the modulus; ECM is an efficient algorithm when the length of modulus is between 40 and 50 digits. In fact, the main costs for each iteration are modular inverse, modular multiplication, modular square and greatest common divisor. However, when compared to modular multiplication and modular square, the costs of modular inverse and greatest common divisor are very high. The aim of this paper is to improve ECM in order to reduce the costs to compute both of modular inverse and greatest common divisor. The proposed method is called Fast Elliptic Curve Factorization Method (F-ECM). For every two adjacent points on the curve, only one modular inverse and one greatest common divisor will be computed. That means it implies that the costs in both of them can be split in half. Furthermore, the length of modulus in the experiment spans from 30 to 65 bits. The experimental results show that F-ECM can finish the task faster than ECM for all cases of the modulus. Furthermore, the computation time is reduced by 30 to 38 percent.