On the hardness of the finite field isomorphism problem
type: Item
instance of: scholarly article
title: On the hardness of the finite field isomorphism problem
zbMATH Open document ID: 1528.94040
DOI: 10.1007/978-3-031-30589-4_12
author: Dipayan Das
author: Antoine Joux
published in: Advances in Cryptology – EUROCRYPT 2023
publication date: 2023-12-08T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7774572
zbMATH Keywords: fully homomorphic encryption scheme
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-031-30589-4 12
OpenAlex ID: W4365934957
cites work: The general sieve kernel and new records in lattice reduction
cites work: Lattices of compatibly embedded finite fields
cites work: BKZ 2.0: Better Lattice Security Estimates
cites work: Fully homomorphic encryption from the finite field isomorphism problem
cites work: Predicting Lattice Reduction
cites work: Lattice Enumeration Using Extreme Pruning
cites work: Q4364546
cites work: Q3840170
cites work: A signature scheme from the finite field isomorphism problem
cites work: Factoring polynomials with rational coefficients
cites work: Fast computation of isomorphisms between finite fields using elliptic curves
Recommended article: Computing isomorphisms and embeddings of finite fields
Recommended article: On the complexity of the isomorphism relation for fields of finite transcendence degree
Recommended article: Explicit computation of isomorphisms between finite fields
Recommended article: On the complexity of multiplication in finite fields
Recommended article: Another look at some isogeny hardness assumptions
Recommended article: Computational problems in the theory of finite fields
Recommended article: The isomorphism problem for classes of computable fields
Recommended article: Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields
Recommended article: On some problems in the theory of finite fields
description: scientific article; zbMATH DE number 7774572