Pages that link to "Item:Q1165896"

The following pages link to Factoring polynomials with rational coefficients (Q1165896):

Displaying 50 items.

• Reconstruction algorithms for sums of affine powers (Q2284961) (← links)
• Cryptanalysis of elliptic curve hidden number problem from PKC 2017 (Q2291665) (← links)
• Principal symmetric space analysis (Q2297876) (← links)
• A stochastic variant of the abelian sandpile model (Q2302674) (← links)
• Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
• On simultaneous approximation in quadratic integer programming (Q2314408) (← links)
• The complexity of solving low degree equations over ring of integers and residue rings (Q2319973) (← links)
• A probabilistic analysis on a lattice attack against DSA (Q2329391) (← links)
• A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths (Q2329392) (← links)
• Generalized cryptanalysis of small CRT-exponent RSA (Q2330126) (← links)
• A new parallel lattice reduction algorithm for BKZ reduced bases (Q2335926) (← links)
• Implicit factorization of unbalanced RSA moduli (Q2346502) (← links)
• A note on BDD problems with \(\lambda_2\)-gap (Q2350585) (← links)
• Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
• Formally verified certificate checkers for hardest-to-round computation (Q2352500) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• Torsion \(\mathbb Z\)-module and torsion-free \(\mathbb Z\)-module (Q2353430) (← links)
• Embedded lattice and properties of Gram matrix (Q2356940) (← links)
• Bounding basis reduction properties (Q2364641) (← links)
• Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
• Low-density attack revisited (Q2384011) (← links)
• A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
• Complexity of integer quasiconvex polynomial optimization (Q2387421) (← links)
• Efficient algorithms for discrete lattice calculations (Q2390437) (← links)
• Post-quantum cryptography: lattice signatures (Q2390954) (← links)
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
• Dual lattice of \(\mathbb{Z}\)-module lattice (Q2407510) (← links)
• Lattices with symmetry (Q2408587) (← links)
• Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
• Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
• Efficient computation of multidimensional theta functions (Q2422388) (← links)
• On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
• Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
• A pivoted LLL algorithm (Q2431149) (← links)
• Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
• MLAMBDA: a modified LAMBDA method for integer least-squares estimation (Q2434053) (← links)
• Recovering a sum of two squares decomposition (Q2437316) (← links)
• Guessing singular dependencies (Q2437325) (← links)
• Explicit rates of approximation in the CLT for quadratic forms (Q2438752) (← links)
• The complexity of LSH feasibility (Q2440169) (← links)
• Limits of a conjecture on a leakage-resilient cryptosystem (Q2445905) (← links)
• On minimum integer representations of weighted games (Q2446687) (← links)
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
• Factoring polynomials over global fields. I (Q2456562) (← links)
• Factoring polynomials over global fields. II. (Q2456609) (← links)
• Computation of unirational fields (Q2457397) (← links)
• Irreducible constituents of monomial representations. (Q2457403) (← links)
• Around the numeric-symbolic computation of differential Galois groups (Q2457420) (← links)
• An improved LLL algorithm (Q2465313) (← links)
• Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\) (Q2467993) (← links)