Subexponential time relations in the class group of large degree number fields
From MaRDI portal
Recommendations
Cites work
- A computational approach for solving $y^2=1^k+2^k+\dotsb+x^k$
- A hierarchy of polynomial time lattice basis reduction algorithms
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- A signature scheme based on the intractability of computing roots
- A subexponential algorithm for evaluating large degree isogenies
- An introduction to the geometry of numbers.
- An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- Binary quadratic forms. An algorithmic approach
- Computing endomorphism rings of elliptic curves under the GRH
- Computing isogenies between abelian varieties
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- scientific article; zbMATH DE number 1643955 (Why is no real title available?)
- scientific article; zbMATH DE number 1808253 (Why is no real title available?)
- scientific article; zbMATH DE number 3889661 (Why is no real title available?)
- scientific article; zbMATH DE number 4200333 (Why is no real title available?)
- scientific article; zbMATH DE number 475432 (Why is no real title available?)
- scientific article; zbMATH DE number 1024052 (Why is no real title available?)
- scientific article; zbMATH DE number 1088248 (Why is no real title available?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- On ideals free of large prime factors
- Solving the Pell equation
- The Number Field Sieve in the Medium Prime Case
Cited in
(20)- Subexponential algorithms for class group and unit computations
- 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})\)
- Computing the endomorphism ring of an ordinary abelian surface over a finite field
- The anisotropic part of a quadratic form over a number field
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Subexponential class group and unit group computation in large degree number fields
- 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
- 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
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm
- Fast practical lattice reduction through iterated compression
- Fast multiquadratic S-unit computation and application to the calculation of class groups
- Generating subgroups of ray class groups with small prime ideals
- Norm relations and computational problems in number fields
- An algorithm for solving the principal ideal problem with subfields
- Efficient computations in central simple algebras using Amitsur cohomology
- Finding dense submodules with algebraic lattice reduction
This page was built for publication: Subexponential time relations in the class group of large degree number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513760)
