default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKritsanapong Somsuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Kritsanapong Somsuk, Sarutte Atsawaraungsuk, Chanwit Suwannapong, Suchart Khummanee, Chalida Sanemueang:
The Variant of Digital Signature Algorithm for Constant Message. J. Internet Serv. Inf. Secur. 13(2): 81-95 (2023)- [j7]Kritsanapong Somsuk, Sarutte Atsawaraungsuk, Chanwit Suwannapong, Suchart Khummanee, Chalida Sanemueang:
The Optimal Equations with Chinese Remainder Theorem for RSA's Decryption Process. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 14(2): 109-120 (2023) - 2022
- [j6]Kritsanapong Somsuk:
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) - [j5]Kritsanapong Somsuk
:
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) - 2021
- [j4]Kritsanapong Somsuk:
The alternative Method to Finish Modular Exponentiation and Point Multiplication Processes. KSII Trans. Internet Inf. Syst. 15(7): 2610-2630 (2021) - [j3]Kritsanapong Somsuk:
The Improvement of Elliptic Curve Factorization Method to Recover RSA's Prime Factors. Symmetry 13(8): 1314 (2021) - 2020
- [j2]Kritsanapong Somsuk:
The new Weakness of RSA and The Algorithm to Solve this Problem. KSII Trans. Internet Inf. Syst. 14(9): 3841-3857 (2020) - [c5]Kritsanapong Somsuk, Chalida Sanemueang:
Fast Special -Purposed Factoring Algorithm by Using Modular Multiplication. KST 2020: 172-176
2010 – 2019
- 2019
- [c4]Kritsanapong Somsuk, Thanapat Chiawchanwattana, Chalida Sanemueang:
Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops. JCSSE 2019: 143-147 - 2017
- [j1]Kritsanapong Somsuk, Kitt Tientanopajai:
An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time. Int. J. Netw. Secur. 19(1): 99-111 (2017) - 2014
- [c3]Kritsanapong Somsuk, Sumonta Kasemvilas:
Possible Prime Modified Fermat Factorization: New Improved Integer Factorization to Decrease Computation Time for Breaking RSA. IC2IT 2014: 325-334 - 2013
- [c2]Kritsanapong Somsuk, Sumonta Kasemvilas:
MFFV2 and MNQSV2: Improved Factorization Algorithms. ICISA 2013: 1-3 - [c1]Kritsanapong Somsuk, Sumonta Kasemvilas:
Comparison Performance of MFFV2 and MVFactor for Factoring the Modulus. ICITCS 2013: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-27 17:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
