{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:30:38Z","timestamp":1764937838869,"version":"3.30.2"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:00:00Z","timestamp":1724803200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100005034","name":"Bina Nusantara University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005034","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,8,28]]},"DOI":"10.1109\/icimtech63123.2024.10780869","type":"proceedings-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T19:14:12Z","timestamp":1734376452000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Case Study: Forecasting Time Consumption Exponential RSA Factorization Using Java Program"],"prefix":"10.1109","author":[{"given":"Martin","family":"Suhartana","sequence":"first","affiliation":[{"name":"BINUS Online Learning Bina Nusantara University,Computer Science Department,Jakarta,Indonesia,11480"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emny Harna","family":"Yossy","sequence":"additional","affiliation":[{"name":"BINUS Online Learning Bina Nusantara University,Computer Science Department,Jakarta,Indonesia,11480"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3390\/mca24020062"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3390\/jcp1040033"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3934\/math.2019.2.242"},{"issue":"1","key":"ref4","first-page":"51","volume":"10","author":"Rasha","year":"2019","journal-title":"Modified RSA Algorithm Using Two Public Key and Chinese Remainder Theorem, I.J. of Electronics and Information Engineering"},{"journal-title":"RSA Private Keys and the Presence of Weak Keys: An Evaluation","year":"2022","author":"Mahmoud","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/07468342.2020.1724495"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1566\/1\/012063"},{"journal-title":"Publishing Company, Inc.","year":"1982","author":"Cryptography","key":"ref8"},{"volume-title":"Generalized Implicit Factorization Problem","year":"2023","author":"Yansong","key":"ref9"},{"journal-title":"Serious Cryptography: A Practical Introduction to Modern Encryption, William Pollock","year":"2008","author":"Aumasson","key":"ref10"},{"key":"ref11","article-title":"An Introduction to Cryptography, 2nd Edition, Discrete Mathematics ITS Applications","author":"Rosen","year":"2007","journal-title":"Taylor & Francis Group, LLC"},{"key":"ref12","article-title":"Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N","volume-title":"arXiv (Cornell University)","author":"Dieulefait","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-11687-7"},{"issue":"1","key":"ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.54646\/BIJSCIT.011","article-title":"Large Semi Primes Factorization with Its Implications to RSA Cryptosystems","volume":"3","author":"Richard","year":"2020","journal-title":"BOHR International Journal of Smart Computing and Information Technology"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899x\/662\/2\/022086"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/access.2021.3129224"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"issue":"1","key":"ref18","first-page":"012030","article-title":"A Study of the Use of Euler Totient Function in RSA Cryptosystem and the Future of RSA Cryptosystem","volume-title":"Journal of Physics: Conference Series","volume":"2386","author":"Wang","year":"2022"},{"issue":"7","key":"ref19","first-page":"825","volume":"17","author":"Martin","year":"2023","journal-title":"Hacking of RSA Cryptography Algorithm Using Pythagorean and Quadratic Equation with Microsoft Excel Solver. ICIC International, Japan"},{"volume-title":"Enhanced RSA Algorithm for Data Security in the Internet of Things. preprint, In Review","year":"2022","author":"Bashart","key":"ref20"},{"issue":"1","key":"ref21","first-page":"012030","article-title":"A Study of the Use of Euler Totient Function in RSA Cryptosystem and the Future of RSA Cryptosystem","volume-title":"Journal of Physics: Conference Series","volume":"2386","author":"Shuodong","year":"2022"},{"key":"ref22","first-page":"1","article-title":"On the Existence of Multiple RSA Private Keys","author":"Chuan-Kun","year":"2022","journal-title":"Security and Communication Networks, edited by Jie Cui, vol. 2022"}],"event":{"name":"2024 International Conference on Information Management and Technology (ICIMTech)","start":{"date-parts":[[2024,8,28]]},"location":"Bali, Indonesia","end":{"date-parts":[[2024,8,29]]}},"container-title":["2024 International Conference on Information Management and Technology (ICIMTech)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10779602\/10780441\/10780869.pdf?arnumber=10780869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T05:49:11Z","timestamp":1734414551000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10780869\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,28]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icimtech63123.2024.10780869","relation":{},"subject":[],"published":{"date-parts":[[2024,8,28]]}}}