On Factoring The RSA Modulus Using Tabu Search

Data Science: Journal of Computing and Applied Informatics

View Publication Info
 
 
Field Value
 
Title On Factoring The RSA Modulus Using Tabu Search
 
Creator Candra, Ade
Budiman, Mohammad Andri
Rachmawati, Dian
 
Description 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.
 
Publisher Talenta Publisher
 
Date 2017-07-18
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
 
Format application/pdf
 
Identifier https://talenta.usu.ac.id/index.php/JoCAI/article/view/65
10.32734/jocai.v1.i1-65
 
Source Data Science: Journal of Computing and Applied Informatics; Vol 1 No 1 (2017): Data Science: Journal of Computing and Applied Informatics (JoCAI); 30-37
2580-829X
2580-6769
 
Language eng
 
Relation https://talenta.usu.ac.id/index.php/JoCAI/article/view/65/30
 
Rights Copyright (c) 2017 Journal of Computing and Applied Informatics
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library