On the Hardness of the Finite Field Isomorphism Problem

ePrint Report: On the Hardness of the Finite Field Isomorphism Problem

Dipayan Das, Antoine Joux

The finite field isomorphism FFI problem, introduced in PKC'18, is an alternative to average-case lattice problems (like LWE, SIS, or NTRU). As an application, the FFI problem is used to construct a fully homomorphic encryption scheme in the same paper. In this work, we prove that the decision variant of the FFI problem can be solved in polynomial time for any field characteristics $q= \Omega(\beta …

eprint report problem