Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
From MaRDI portal
Publication:4575643
Recommendations
- Fast quantum algorithms for computing the unit group and class group of a number field
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Quantum algorithms for number fields
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Quantum algorithms for a set of group theoretic problems
- Quantum algorithms for solvable groups
- Publication:3470563
- An efficient quantum algorithm for some instances of the group isomorphism problem
- Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
- Quantum algorithms for fixed points and invariant subgroups
Cited in
(48)- Improved reversible and quantum circuits for Karatsuba-based integer multiplication
- Orientations and the supersingular endomorphism ring problem
- Classical and Quantum Algorithms for Exponential Congruences
- The special case of cyclotomic fields in quantum algorithms for unit groups
- FuLeakage: breaking FuLeeca by learning attacks
- Quantum algorithms for variants of average-case lattice problems via filtering
- Fast multiquadratic S-unit computation and application to the calculation of class groups
- On the quantum complexity of the continuous hidden subgroup problem
- Return of GGH15: provable security against zeroizing attacks
- Quantum algorithms for number fields
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Computing \(e\)-th roots in number fields
- Short generators without quantum computers: the case of multiquadratics
- Short Stickelberger class relations and application to Ideal-SVP
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-Based GSW-FHE
- On the ideal shortest vector problem over random rational primes
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Computation of lattice isomorphisms and the integral matrix similarity problem
- An algorithm for solving the principal ideal problem with subfields
- Fast practical lattice reduction through iterated compression
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- On the discrete logarithm problem in the ideal class group of multiquadratic fields
- Application of automorphic forms to lattice problems
- Short principal ideal problem in multicubic fields
- Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
- Cryptanalyses of Candidate Branching Program Obfuscators
- Security analysis of cryptosystems using short generators over ideal lattices
- Norm relations and computational problems in number fields
- Subfield algorithms for ideal- and module-SVP based on the decomposition group
- SCALLOP-HD: group action from 2-dimensional isogenies
- Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
- Efficient computations in central simple algebras using Amitsur cohomology
- 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
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\)
- Algorithmic Number Theory
- Generic models for group actions
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)
- Recovering short generators of principal fractional ideals in cyclotomic fields of conductor \(p^\alpha q^\beta\)
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
- Fast quantum algorithms for computing the unit group and class group of a number field
- Quantum-access-secure message authentication via blind-unforgeability
- Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation.
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm
- Reductions from module lattices to free module lattices, and application to dequantizing module-LLL
- Generating subgroups of ray class groups with small prime ideals
This page was built for publication: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575643)
