Pages that link to "Item:Q2429362"

The following pages link to Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362):

Displaying 11 items.

• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
• Isomorphisms of algebraic number fields (Q713173) (← links)
• Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
• Computing subfields of number fields and applications to Galois group computations (Q1733297) (← links)
• The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
• Towards faster polynomial-time lattice reduction (Q2128584) (← links)
• Lattice Reduction for Modular Knapsack (Q3455505) (← links)
• (Q3557048) (redirect page) (← links)
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages (Q4916015) (← links)
• -adic images of Galois for elliptic curves over (and an appendix with John Voight) (Q5101299) (← links)
• Odd degree isolated points on \(X_1(N)\) with rational \(j\)-invariant (Q6183520) (← links)