Factoring

Factoring, finding a non-trivial factorization of a composite positive integer, is believed to be a hard problem. How hard we think it is, however, changes almost on a daily basis. Predicting how hard factoring will be in the future, an important issue for cryptographic applications of composite numbers, is therefore a challenging task. The author presents a brief survey of general purpose integer factoring algorithms and their implementations