Article Per Year (5 Year)
p-Index From 2021 - 2026
2.386
P-Index
This Author published in this journals
All Journal Alkhawarizmi Jurnal Pendidikan Ekonomi (JUPE) Folia Medica Indonesiana Jurnal Edukasi dan Penelitian Informatika (JEPIN) Sinkron : Jurnal dan Penelitian Teknik Informatika Juripol JURNAL EKONOMI PENDIDIKAN DAN KEWIRAUSAHAAN Data Science: Journal of Computing and Applied Informatics Jurnal Ilmiah Mandala Education (JIME) Perspektif Pendidikan dan Keguruan JTIK (Jurnal Teknik Informatika Kaputama) Jurnal Pengabdian, Pendidikan dan Teknologi 3BIO: Journal of Biological Science, Technology and Management DEVOSI International Journal of Social Service and Research Kajian Linguistik Indonesian Journal of Educational Development (IJED) Jurnal Pendidikan Indonesia Gemilang International Journal of Biology Education Towards Sustainable Development Jurnal Pendidikan Abad Ke-21 JOIES (Journal of Islamic Education Studies) Jurnal Gotong Royong
Dian Rachmawati
Universitas Sumatera Utara
Religion Agriculture, Biological Sciences & Forestry Arts Humanities Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Environmental Science Immunology & microbiology Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Mathematics Neuroscience Social Sciences Other

Published : 27 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Data Science: Journal of Computing and Applied Informatics

 1 
On Factoring The RSA Modulus Using Tabu Search Ade Candra; Mohammad Andri Budiman; Dian Rachmawati
Data Science: Journal of Computing and Applied Informatics Vol. 1 No. 1 (2017): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (468.763 KB) | DOI: 10.32734/jocai.v1.i1-65

Abstract

It is intuitively clear that the security of RSA cryptosystem depends on the hardness of factoring a very large integer into its two prime factors. Numerous studies about integer factorization in the field of number theory have been carried out, and as a result, lots of exact factorization algorithms, such as Fermat’s factorization algorithm, quadratic sieve method, and Pollard’s rho algorithm have been found. The factorization problem is in the class of NP (non-deterministic polynomial time). Tabu search is a metaheuristic in the field of artificial intelligence which is often used to solve NP and NP-hard problems; the result of this method is expected to be close-to-optimal (suboptimal). This study aims to factorize the RSA modulus into its two prime factors using tabu search by conducting experiments in Python programming language and to compare its time performance with an exact factorization algorithm, i.e. Pollard’s algorithm. The primality test is done with Lehmann’s algorithm.
Using random search and brute force algorithm in factoring the RSA modulus Mohammad Andri Budiman; Dian Rachmawati
Data Science: Journal of Computing and Applied Informatics Vol. 2 No. 1 (2018): Data Science: Journal of Computing and Applied Informatics (JoCAI)
Publisher : Talenta Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1163.568 KB) | DOI: 10.32734/jocai.v2.i1-91

Abstract

Abstract. The security of the RSA cryptosystem is directly proportional to the size of its modulus, n. The modulus n is a multiplication of two very large prime numbers, notated as p and q. Since modulus n is public, a cryptanalyst can use factorization algorithms such as Euler’s and Pollard’s algorithms to derive the private keys, p and q. Brute force is an algorithm that searches a solution to a problem by generating all the possible candidate solutions and testing those candidates one by one in order to get the most relevant solution. Random search is a numerical optimization algorithm that starts its search by generating one candidate solution randomly and iteratively compares it with other random candidate solution in order to get the most suitable solution. This work aims to compare the performance of brute force algorithm and random search in factoring the RSA modulus into its two prime factors by experimental means in Python programming language. The primality test is done by Fermat algorithm and the sieve of Eratosthenes.
Co-Authors Ade Candra Ade Candra, Ade Aditya Rahandi Agung Haryono Alimsardjono, Lindawati Amalina, Endah Ardianto, Riski Eko Arinto Nugroho Bayu Pradana, Andika Benedict, Marthin Budi Satria Muchlis, Budi Satria CATUR RIANI Dedy Arisandi Djeinnie Imbang, Djeinnie Evi Amelia, Evi Evi Mariani Harahap Fachry Abda El Rahman Fithaloka, Dhea Fitri Nur Mahmudah Fitriana, Desi Eka Nur Fuziyanti, Ani Hardiyanti, Renny Herriyance Herriyance Hidayati, Dian Iing Dwi Lestari Indra Aulia Indra Permana, Indra Jaedah, Siti Kalangi, Leika Maria Victoria Kalangi, Leika Maria Victoria Kuntaman Kuntaman Kurniati, Dwi Elfira Lisa Rokhmani Marthin Benedict Mila Ermila Hendriyani, Mila Ermila Mohammad Andri Budiman Mohammad Andri Budiman Najmi Firdaus Nurhidayah, S. Psi., M.Si, Siti nurul khotimah Rida Oktorida Khastini Rizky Dwi Putri Rizza Megasari Rustianah, Rustianah Sajadin Sembiring Seniman Seniman Siti Gia Syauqiyah Fitri, Siti Gia Syauqiyah Survani, Rifki WF, Anike Fifilusianty Yusron Masduki, Yusron