The special case of cyclotomic fields in quantum algorithms for unit groups

DOI10.1007/978-3-031-37679-5_10arXiv2303.03978MaRDI QIDQ6186351

Publication date: 2 February 2024

Published in: Progress in Cryptology - AFRICACRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.03978

Mathematics Subject Classification ID

Cryptography (94A60) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A generalization of the LLL-algorithm over Euclidean rings or orders
On Lovász' lattice reduction and the nearest lattice point problem
Factoring polynomials with rational coefficients
On bases of the Stickelberger ideal and of the group of circular units of a cyclotomic field
New bounds in some transference theorems in the geometry of numbers
Unit groups for complex dihedral extensions of degree 10 over $\mathbb Q$
Quantum resource estimates for computing elliptic curve discrete logarithms
Lattice reductions over Euclidean rings with applications to cryptanalysis
On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in $\mathbb{Q}(\zeta_{2^s})$
On the quantum complexity of the continuous hidden subgroup problem
An LLL algorithm for module lattices
Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
Fast quantum algorithms for computing the unit group and class group of a number field
Polynomial time quantum algorithm for the computation of the unit group of a number field
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
Class numbers of real cyclotomic fields of prime conductor
Short Bases of Lattices over Number Fields
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
An extension of the fpLLL library to Hermitian lattices
A quantum algorithm for computing the unit group of an arbitrary degree number field
Computing a lattice basis from a system of generating vectors
Recovering Short Generators of Principal Ideals in Cyclotomic Rings
The Number Field Sieve in the Medium Prime Case
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Efficient verifiable delay functions

This page was built for publication: The special case of cyclotomic fields in quantum algorithms for unit groups