Progrès de la recherche en sciences appliquées Libre accès

Abstrait

Performance Analysis of Montgomery Multiplication Algorithm for Multi-core Systems Using Concurrent Java

Lavanya P and M Rajashekhara Babu

The Requirement of information security on topology network has become more important. Cryptography is a method to provide information confidentiality, authenticity and integrity. There are so many challenges to implement a public key cryptography algorithm such as execution time, time consuming, time cost, integrated methods, memory Requirement in public key cryptography. In parallel computation to solve the formal algorithm in parallel by partitioning method can scale over different number of cores given .A parallel computation can be stable perform analysis of public key cryptography using concurrent java core communication such as available time, request time, allowance time . In this paper, public key cryptography algorithm can be implemented a parallel RSA with threads and to improve the performance of the algorithm by execution time. Various public key cryptography algorithms can be implemented using execution time.

Avertissement: test