{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:30:29Z","timestamp":1730280629582,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1109\/kst48564.2020.9059380","type":"proceedings-article","created":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T03:50:23Z","timestamp":1586490623000},"page":"172-176","source":"Crossref","is-referenced-by-count":0,"title":["Fast Special -Purposed Factoring Algorithm by Using Modular Multiplication"],"prefix":"10.1109","author":[{"given":"Kritsanapong","family":"Somsuk","sequence":"first","affiliation":[]},{"given":"Chalida","family":"Sanemueang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"918","article-title":"Monte Carlo methods for index computation (mod p)","volume":"32","author":"pollard","year":"1978","journal-title":"Mathematics of Computation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.06.008"},{"key":"ref12","first-page":"95","article-title":"Sufficient conditions for factoring a class of large integers","volume":"13","author":"omar","year":"2010","journal-title":"Journal of Discrete Mathematical Sciences and Cryptography"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2018.1502737"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DMCC.1990.555392"},{"key":"ref15","first-page":"83","article-title":"A guide to General Number Field Sieve for Integer Factorization","volume":"4","author":"pandy","year":"2014","journal-title":"Investigations in Mathematical Sciences"},{"key":"ref16","first-page":"99","article-title":"An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time","volume":"19","author":"somsuk","year":"2017","journal-title":"International Journal of Network Security"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CSNT.2011.29"},{"key":"ref3","first-page":"992","article-title":"Modified Trial Division Algorithm Using KNJ-Factorization Method To Factorize RSA Public Key Encryption","author":"nidhi","year":"2014","journal-title":"Int Conf Contemp Comput Informatics"},{"journal-title":"Introduction to Cryptography with Java Applets","year":"2003","author":"bishop","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JCSSE.2019.8864218"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CSNT.2012.208"},{"key":"ref7","first-page":"677","article-title":"Comparative study on Integer Factorization Algorithm-Pollard‘s RHO and Pollard's P-1","author":"sarnaik","year":"2015","journal-title":"Proceedings of the International Conference on Computing for Sustainable Global Development"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2902571"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref9","first-page":"59","article-title":"Generalized Trial Division","volume":"6","author":"murat","year":"2011","journal-title":"Int J Contemp Math Sci"}],"event":{"name":"2020 12th International Conference on Knowledge and Smart Technology (KST)","start":{"date-parts":[[2020,1,29]]},"location":"Pattaya, Chonburi, Thailand","end":{"date-parts":[[2020,2,1]]}},"container-title":["2020 12th International Conference on Knowledge and Smart Technology (KST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9046108\/9059301\/09059380.pdf?arnumber=9059380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:51:59Z","timestamp":1656453119000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9059380\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/kst48564.2020.9059380","relation":{},"subject":[],"published":{"date-parts":[[2020,1]]}}}