Subexponential class group and unit group computation in large degree number fields
From MaRDI portal
Recommendations
- Subexponential algorithms for class group and unit computations
- scientific article; zbMATH DE number 4200333
- Subexponential time relations in the class group of large degree number fields
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- scientific article; zbMATH DE number 16712
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A hierarchy of polynomial time lattice basis reduction algorithms
- A subexponential algorithm for evaluating large degree isogenies
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On ideals free of large prime factors
- On some problems of a statistical group-theory. I
- On zeta functions of number fields
- Subexponential algorithms for class group and unit computations
- The Number Field Sieve in the Medium Prime Case
Cited in
(36)- Subexponential algorithms for class group and unit 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
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Computing the endomorphism ring of an ordinary abelian surface over a finite field
- Subexponential time relations in the class group of large degree number fields
- Computing residue class rings and Picard groups of orders
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Improved techniques for computing the ideal class group and a system of fundamental units in number fields
- Reducing number field defining polynomials: an application to class group computations
- scientific article; zbMATH DE number 4200333 (Why is no real title available?)
- scientific article; zbMATH DE number 2086881 (Why is no real title available?)
- Computation of lattice isomorphisms and the integral matrix similarity problem
- Computing normal integral bases of abelian number fields
- Cryptanalyses of Candidate Branching Program Obfuscators
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Short Stickelberger class relations and application to Ideal-SVP
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm
- 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
- Computing the unit group of a commutative finite \(\mathbb{Z}\)-algebra
- An algorithm for solving the principal ideal problem with subfields
- Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Isotropic vectors over global fields
- Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes
- A reduction from Hawk to the principal ideal problem in a quaternion algebra
- Faster SCALLOP from non-prime conductor suborders in medium sized quadratic fields
- Pseudo-random walk on ideals: practical speed-up in relation collection for class group computation
This page was built for publication: Subexponential class group and unit group computation in large degree number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878849)
