Subexponential time relations in the class group of large degree number fields
From MaRDI portal
Publication:2513760
DOI10.3934/amc.2014.8.407zbMath1358.11125OpenAlexW2035829038MaRDI QIDQ2513760
Publication date: 28 January 2015
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2014.8.407
Quadratic extensions (11R11) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29)
Related Items
Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ The anisotropic part of a quadratic form over a number field ⋮ 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 ⋮ Fast practical lattice reduction through iterated compression ⋮ Fast multiquadratic S-unit computation and application to the calculation of class groups ⋮ Security analysis of cryptosystems using short generators over ideal lattices ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary quadratic forms. An algorithmic approach
- Solving the Pell equation
- A hierarchy of polynomial time lattice basis reduction algorithms
- A signature scheme based on the intractability of computing roots
- On ideals free of large prime factors
- An introduction to the geometry of numbers.
- Computing endomorphism rings of elliptic curves under the GRH
- Computing isogenies between abelian varieties
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- A computational approach for solving $y^2=1^k+2^k+\dotsb+x^k$
- A Subexponential Algorithm for Evaluating Large Degree Isogenies
- Fully homomorphic encryption using ideal lattices
- 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
- An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
- The Number Field Sieve in the Medium Prime Case
