抄録
After the emergence of the RSA encryption in which the difficulty of the prime factorization was used for in the security technology of the Internet, the difficulty of the prime factorization has been greatly concerned with the safety of the security. In order to speed up the prime factorization by using elliptic curve method, we carried out distributed parallel processing with 50 PC units connected to a network. We developed the distributed parallel calculation of the prime factorization in the elliptic curve method to adapt it to object-shared space (tuple space) which works on the server, and performed the distributed parallel processing with worker-master pattern. The experimental result of the system indicates that the speed of the prime factorization of long composite integers increases with increasing PC units and the calculation time of prime factorization mainly depends on the size of prime factors.
