Integer Factorization Problem Solving Using Tabu Search

Authors

  • Ahmed Tariq Sadiq
  • Tayseer Salman Atia
  • Abd-alsattar Salim Awad

DOI:

https://doi.org/10.31185/jwsm.20

Keywords:

Tabu Search

Abstract

Tabu Search (TS) technique is one way of search for goal algorithm in the Artificial Intelligent (AI). TS is used to solve several optimization problems. In this paper a proposed TS algorithm will be presented to solve the integer factorization problem that plays very big role in the cryptanalysis of public-key cryptography. The experimental result of this work shows that the proposed algorithm can factorize the numbers in good time compared with genetic algorithm technique.

Downloads

Published

2022-10-02

Issue

Vol. 2 No. 1 (2009)

Section

Articles

License

Copyright (c) 2009 Ahmed Tariq Sadiq, Tayseer Salman Atia, Abd-alsattar Salim Awad

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Sadiq, A. T., Atia, T. S., & Awad, A.- alsattar S. (2022). Integer Factorization Problem Solving Using Tabu Search. Journal of Wasit for Science and Medicine, 2(1), 1-10. https://doi.org/10.31185/jwsm.20