Scalable interger factorization for public key crytosystems

Sumarry form only given, as follows. Currently, global data and communication networks are used not only as a way for scientists and researchers around the world to share ideas and information but also as an increasingly effective way for businesses, financial institutions and government organizations to communicate and engage in commercial activities. Therefore, currently communication and network security is becoming an extremely important area of product research and development. The integer factorization and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of solving these problems. For example, there is no known deterministic or randomized polynomial time algorithm for finding a factor of a given composite integer. If a fast integer factorization could be implemented, then the most popular algorithm of public key cryptography, the RSA algorithm would be insecure. In this presentation, some of the most recent advances on solving integer factorization on high performance computer architectures will be reported and discussed.