IFP

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

IFP

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

Mentioned in ?

References in periodicals archive ?

Rivest et al [9] is based on modular exponentiation and the security of the system is based on the hard ness of integer factorization problem. In RSA the cipher text C is obtained for the plaintext message M [member of] [z.sup.*.sub.N] as C = [M.sup.e] mod N, where N is the product of two large prime numbers of same length, e is the public key chosen such that it is relatively prime with the Euler totient function [phi](N) and 1 < e < [phi](N).

* Because of the trapdoor integer factorization problem, it is computationally infeasible for an intruder to find the Euler totient function [phi](N).

Public Key Cryptosystem based on Number Theoretic Transforms resisting brute force attack

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. These ideas were realized in [7, 8, 9].

Microprocessor realization of key agreement protocol based on matrix power function/ Raktu apsikeitimo protokolo, paremto matricu laipsnio funkcija, realizacija mikroprocesoriuose