Quantumly computing S-unit groups in quantified polynomial time and space
From MaRDI portal
Cites work
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- An LLL algorithm for module lattices
- An LLL algorithm with quadratic complexity
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Approx-SVP in ideal lattices with pre-processing
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Explicit Bounds for Primality Testing and Related Problems
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3750287 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- Ideal-SVP is hard for small-norm uniform prime ideals
- Integer multiplication in time \(O(n\log n)\)
- New bounds for matrix multiplication: from alpha to omega
- On the quantum complexity of the continuous hidden subgroup problem
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Pseudorandomness of ring-LWE for any ring and modulus
- Quantum computation and quantum information. 10th anniversary edition
- Quantum FHE (almost) as secure as classical
- Quantum lattice enumeration in limited depth
- Quantum LLL with an application to Mersenne number cryptosystems
- Random self-reducibility of ideal-SVP via Arakelov random walks
- Recovering short generators of principal ideals in cyclotomic rings
- Short Stickelberger class relations and application to Ideal-SVP
- The hidden subgroup problem and eigenvalue estimation on a quantum computer
- The special case of cyclotomic fields in quantum algorithms for unit groups
- Trapdoors for hard lattices and new cryptographic constructions
This page was built for publication: Quantumly computing S-unit groups in quantified polynomial time and space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7447180)