Work

Particle Swarm Optimization Algorithm for Integer Factorization Problem (IFP)

Year: 2015

Type: article

Abstract: This paper presents particle swarm optimization (PSO) method to find the prime factors of a composite number.Integer factorization is a well known NP hard problem and security of many cryptosystem is based on difficulty of integer factorization.A particle swarm optimization algorithm for integer factorization has been devised and tested on different 100 numbers.It has been found that the PSO method performs with little variability over swarm size.

Source: International Journal of Computer Applications

DOI: 10.5120/20613-3276

Authors: Bhargab Choudhury, Sangita Neog

Institution: North Eastern Hill University

Language: English

Topic: Metaheuristic Optimization Algorithms Research

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2287618284

FWCI:

Cites: 19

Cited by: 1

Related to: 10