Article 2013 MUT Institutional Repository
Advances in composite integer factorization
Abstract
In this research we propose a new method of integer factorization. Prime numbers are the building blocks of arithmetic. At the moment there are no efficient methods (algorithms) known that will determine whether a given integer is prime or and its prime factors [1]. This fact is the basis behind many of the cryptosystems currently in use.
Description
Keywords
logarithm
