Paper 2022/998
On the Hardness of the Finite Field Isomorphism Problem
Abstract
The finite field isomorphism (FFI) problem was introduced in PKC'18, as an alternative to average-case lattice problems (like LWE, SIS, or NTRU). As an application, the same paper used the FFI problem to construct a fully homomorphic encryption scheme. In this work, we prove that the decision variant of the FFI problem can be solved in polynomial time for any field characteristics
Note: Minor typos have been fixed.
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Published by the IACR in EUROCRYPT 2023
- Keywords
- LatticeFinite fieldCryptanalysis
- Contact author(s)
-
dipayan das @ cispa de
joux @ cispa de - History
- 2023-02-20: last of 2 revisions
- 2022-08-03: received
- See all versions
- Short URL
- https://ia.cr/2022/998
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/998, author = {Dipayan Das and Antoine Joux}, title = {On the Hardness of the Finite Field Isomorphism Problem}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/998}, year = {2022}, url = {https://eprint.iacr.org/2022/998} }