On the hardness of the finite field isomorphism problem

DOI10.1007/978-3-031-30589-4_12zbMath1528.94040OpenAlexW4365934957MaRDI QIDQ6083668

Dipayan Das, Antoine Joux

Publication date: 8 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30589-4_12

zbMATH Keywords

fully homomorphic encryption scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Lattices of compatibly embedded finite fields
• Fast computation of isomorphisms between finite fields using elliptic curves
• Fully homomorphic encryption from the finite field isomorphism problem
• A signature scheme from the finite field isomorphism problem
• The general sieve kernel and new records in lattice reduction
• BKZ 2.0: Better Lattice Security Estimates
• Lattice Enumeration Using Extreme Pruning
• Predicting Lattice Reduction

This page was built for publication: On the hardness of the finite field isomorphism problem