Download now Free registration required
The security of public key encryption such as RSA scheme relied on the integer factoring problem. The security of RSA algorithm is based on positive integer N, because each transmitting node generates pair of keys such as public and private. Encryption and decryption of any message depends on N. Where, N is the product of two prime numbers and pair of key generation is dependent on these prime numbers. The factorization of N is very intricate. In this paper a New Factorization method is proposed to obtain the factor of positive integer N. The proposed paper focuses on factorization of all trivial and nontrivial integer numbers and requires fewer steps for factorization process of RSA modulus N.
- Format: PDF
- Size: 679.25 KB