An investigation on Integer Factorization applied to Public Key Cryptography

This thesis will present different strategies to face this well-known problem of Number Theory, the Integer Factorization Problem (IFP), and characterize the elements used in GNFS through some systems having integer solutions, that can be found using Groebner Bases.