Pages that link to "Item:Q5259563"
From MaRDI portal
The following pages link to A quantum algorithm for computing the unit group of an arbitrary degree number field (Q5259563):
Displaying 29 items.
- Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation. (Q1404927) (← links)
- SICs and algebraic number theory (Q1698308) (← links)
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) (Q1746982) (← links)
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) (Q2009413) (← links)
- Short principal ideal problem in multicubic fields (Q2023319) (← links)
- Quantum-access-secure message authentication via blind-unforgeability (Q2055681) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Deterministic algorithms for the hidden subgroup problem (Q2105456) (← links)
- On the quantum complexity of the continuous hidden subgroup problem (Q2119017) (← links)
- Quantum algorithms for variants of average-case lattice problems via filtering (Q2170094) (← links)
- Quantum computation of zeta functions of curves (Q2506162) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem (Q2685660) (← links)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← links)
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings (Q2953777) (← links)
- Quantum algorithms for number fields (Q3423180) (← links)
- Fast quantum algorithms for computing the unit group and class group of a number field (Q3581441) (← links)
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields (Q4575643) (← links)
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication. (Q4637981) (← links)
- (Q5005126) (← links)
- Computation of lattice isomorphisms and the integral matrix similarity problem (Q5041469) (← links)
- Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem (Q5900520) (← links)
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP (Q6135454) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
- Efficient computations in central simple algebras using Amitsur cohomology (Q6667410) (← links)
