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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
