Software – Graphical Integer Factorization Technique

I am a one person company (OPC) that does research in both cryptography and cryptanalysis with the aim to create new products and/ or services.

Graphical Integer Factorization Technique.

Prime numbers are the building blocks of arithmetic. The reason is because every integer greater than 1 is either a prime or a finite product of prime numbers and such product is unique. Thus, being able to decompose or factor an integer is of fundamental importance to number theory.
Anyhow, it seems that efficient integer factorization is a truly difficult task. Several methods (ECM, QS and NFS) are in use today but they all fail to scale-up to numbers such as RSA-1024 bits and beyond. 3D integer factorization is an alternative since it attempts to generate a multiple of any prime factor and uses a search experiment to find such prime number. Unfortunately, this new scheme requires further research.
In the present work, GIFT is the natural aftermath in our line of reasoning because it creates a bridge between number theory and graph theory [3]. In this new approach, every integer is a finite set of decimal digits and such set corresponds to a graph. We hope that such link reveals the intrinsic relationship that may exist between the digits of an integer and its prime factors.