IFP

(redirected from Integer factorization problem)
Also found in: Dictionary.

IFP

IFP

(1) (Intelligent Forms Processing) Using advanced techniques to scan documents and determine their data content. See ICR.

(2) (Integer Factorization Problem) The difficulty of finding prime numbers in an encryption key. The public key in RSA encryption is derived by multiplying two large prime numbers together. To date, there has never been an efficient algorithm that could be used to factor such numbers from the key, thus enabling the RSA method to survive as long as the keys keep getting larger to stay ahead of ever-increasing computing power.

In 2002, Indian scientist Manindra Agrawal discovered a faster way to determine prime numbers, and the press had a field day predicting the end to Internet encryption. In fact, determining prime numbers does not help in factoring the two primes that make up the key.
References in periodicals archive ?
Because of the trapdoor integer factorization problem, it is computationally infeasible for an intruder to find the Euler totient function [phi](N).
By the hardness of integer factorization problem given N, it is difficult to its factors p, q and in turn [phi](N).
In 1993 new ideas appeared in asymmetric cryptography [6]--using known hard computational problems in infinite non-commutative groups instead of hard number theory problems such as discrete logarithm or integer factorization problems.