On the ideal shortest vector problem over random rational primes (Q2056701): Difference between revisions

@@ Property / arXiv ID @@
+.10278
@@ Property / arXiv ID: 2004.10278 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228459
@@ Property / cites work: Q4228459 / rank @@
+Normal rank
@@ Property / cites work @@
+A Subfield Lattice Attack on Overstretched NTRU Assumptions
+Normal rank
@@ Property / cites work @@
+NTRU prime: reducing attack surface at low cost
@@ Property / cites work: NTRU prime: reducing attack surface at low cost / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Generator in Cyclotomic Integer Rings
@@ Property / cites work: Computing Generator in Cyclotomic Integer Rings / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
+Normal rank
@@ Property / cites work @@
+An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
+Normal rank
@@ Property / cites work @@
+Recovering Short Generators of Principal Ideals in Cyclotomic Rings
+Normal rank
@@ Property / cites work @@
+Short Stickelberger Class Relations and Application to Ideal-SVP
+Normal rank
@@ Property / cites work @@
+On the shortness of vectors to be found by the ideal-SVP quantum algorithm
+Normal rank
@@ Property / cites work @@
+A quantum algorithm for computing the unit group of an arbitrary degree number field
+Normal rank
@@ Property / cites work @@
+Q3840170
@@ Property / cites work: Q3840170 / rank @@
+Normal rank
@@ Property / cites work @@
+Revisiting Lattice Attacks on Overstretched NTRU Parameters
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Q3745276
@@ Property / cites work: Q3745276 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Compact Knapsacks Are Collision Resistant
+Normal rank
@@ Property / cites work @@
+On Ideal Lattices and Learning with Errors over Rings
+Normal rank
@@ Property / cites work @@
+Number fields
@@ Property / cites work: Number fields / rank @@
+Normal rank
@@ Property / cites work @@
+Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
+Normal rank
@@ Property / cites work @@
+Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
+Normal rank
@@ Property / cites work @@
+Q4829810
@@ Property / cites work: Q4829810 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4254917
@@ Property / cites work: Q4254917 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
+Normal rank
@@ Property / cites work @@
+Pseudorandomness of ring-LWE for any ring and modulus
+Normal rank
@@ Property / cites work @@
+Theory of Cryptography
@@ Property / cites work: Theory of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Approx-SVP in ideal lattices with pre-processing
@@ Property / cites work: Approx-SVP in ideal lattices with pre-processing / rank @@
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+Lattice basis reduction: Improved practical algorithms and solving subset sum problems
+Normal rank
@@ Property / cites work @@
+Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
+Normal rank
@@ Property / cites work @@
+Efficient Public Key Encryption Based on Ideal Lattices
+Normal rank