Abstract:

It is wellknown that the security of the most famous and widely used publickey cryptosystem RSA relies on the computational intractability of the integer factorization problem. In this paper, we shall discuss some new directions and new developments in integer factorization, and their implications in the cryptanalysis of RSA and other factoringbased cryptosystems.

Key words: prime numbers;prime factorization;integer factorization;RSA cryptography;information security