Subexponential class group and unit group computation in large degree number fields
From MaRDI portal
Publication:2878849
DOI10.1112/S1461157014000345zbMath1369.11103MaRDI QIDQ2878849
Jean-François Biasse, Claus Fieker
Publication date: 5 September 2014
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Units and factorization (11R27) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29)
Related Items (20)
Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ Computing the endomorphism ring of an ordinary abelian surface over a finite field ⋮ Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares ⋮ Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP ⋮ Fast practical lattice reduction through iterated compression ⋮ Fast multiquadratic S-unit computation and application to the calculation of class groups ⋮ On the construction of class fields ⋮ Reductions from module lattices to free module lattices, and application to dequantizing module-LLL ⋮ Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices ⋮ Reducing number field defining polynomials: an application to class group computations ⋮ Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) ⋮ COMPUTING NORMAL INTEGRAL BASES OF ABELIAN NUMBER FIELDS ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ Cryptanalyses of Candidate Branching Program Obfuscators
Cites Work
- A hierarchy of polynomial time lattice basis reduction algorithms
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Subexponential algorithms for class group and unit computations
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- On ideals free of large prime factors
- On zeta functions of number fields
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- A Subexponential Algorithm for Evaluating Large Degree Isogenies
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- On some problems of a statistical group-theory. I
- The Number Field Sieve in the Medium Prime Case
This page was built for publication: Subexponential class group and unit group computation in large degree number fields
