查看文章

In this paper a Particle Swarm Organization guided faster version of public-key cryptography in wireless communication has been proposed by minimizing total number of modular multiplication, so that faster exponentiation can efficiently implemented which in turn progress the time requirements of the encryption/decryption of large number of plain or cipher text. Minimization of number of modular multiplication itself a NP-hard problem that means there is no polynomial time deterministic algorithm for this purpose. So, in this paper improved version of optimization algorithm using soft computing tools has been discussed to minimize the modular multiplication. This proposed SIFPKC technique begins with an initial population comprises of set of valid and complete set of particles. Then some operators like particles local best and global best positions along with velocity updating rules are used to generate feasible valid particle from the existing one. Among several exponents the best solution reached by SIFPKC is compared with some of the existing techniques. Extensive simulation shows competitive results for the proposed algorithm.