( en | de | ru )

 

Disambiguation of "Somsuk, Kritsanapong"

Author of the publication

copydeleteadd this publication to your clipboard
An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time.

, and . Int. J. Netw. Secur., 19 (1): 99-111 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Somsuk, Kritsanapong
add a person with the name Somsuk, Kritsanapong
 

Other publications of authors with the same name

Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops., , and . JCSSE, page 143-147. IEEE, (2019)The Variant of Digital Signature Algorithm for Constant Message., , , , and . J. Internet Serv. Inf. Secur., 13 (2): 81-95 (May 2023)An Efficient Variant of Pollard's p - 1 for the Case That All Prime Factors of the p - 1 in B-Smooth.. Symmetry, 14 (2): 312 (2022)The alternative Method to Finish Modular Exponentiation and Point Multiplication Processes.. KSII Trans. Internet Inf. Syst., 15 (7): 2610-2630 (2021)MFFV2 and MNQSV2: Improved Factorization Algorithms., and . ICISA, page 1-3. IEEE, (2013)An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time., and . Int. J. Netw. Secur., 19 (1): 99-111 (2017)Comparison Performance of MFFV2 and MVFactor for Factoring the Modulus., and . ICITCS, page 1-4. IEEE Computer Society, (2013)Possible Prime Modified Fermat Factorization: New Improved Integer Factorization to Decrease Computation Time for Breaking RSA., and . IC2IT, volume 265 of Advances in Intelligent Systems and Computing, page 325-334. Springer, (2014)The Improvement of Elliptic Curve Factorization Method to Recover RSA's Prime Factors.. Symmetry, 13 (8): 1314 (2021)The Improved Estimation of the Least Upper Bound to Search for RSA's Private key.. KSII Trans. Internet Inf. Syst., 16 (6): 2074-2093 (2022)