Pages that link to "Item:Q1165896"
From MaRDI portal
The following pages link to Factoring polynomials with rational coefficients (Q1165896):
Displaying 50 items.
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- On the orthogonality of the Chebyshev-Frolov lattice and applications (Q1675297) (← links)
- Matrix product constraints by projection methods (Q1675556) (← links)
- An even extremal lattice of rank 64 (Q1686156) (← links)
- Calculation of Belyi functions for trees with weighted edges (Q1687948) (← links)
- Isomorphism theorem on vector spaces over a ring (Q1688742) (← links)
- Analysis of hidden number problem with hidden multiplier (Q1691252) (← links)
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\) (Q1692331) (← links)
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
- Algorithms for commutative algebras over the rational numbers (Q1704817) (← links)
- Systematics of aligned axions (Q1706848) (← links)
- Four-loop non-singlet splitting functions in the planar limit and beyond (Q1709268) (← links)
- CSIDH: an efficient post-quantum commutative group action (Q1710683) (← links)
- Fault-tolerant modular reconstruction of rational numbers (Q1711994) (← links)
- Further improvement of factoring \(N=p^rq^s\) with partial known bits (Q1726017) (← links)
- A generalized attack on some variants of the RSA cryptosystem (Q1726690) (← links)
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound (Q1727391) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← 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)
- Stable presentation length of 3-manifold groups (Q1743501) (← links)
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction (Q1744015) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) (← links)
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) (Q1746982) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Approximating rings of integers in number fields (Q1805356) (← links)
- Decomposing algebraic sets using Gröbner bases (Q1823621) (← links)
- LLL \(\and\) ABC (Q1827525) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- On the construction of the finite simple groups with a given centralizer of a 2-central involution (Q1841848) (← links)
- Random lattices, threshold phenomena and efficient reduction algorithms. (Q1853481) (← links)
- A lattice-based public-key cryptosystem (Q1854277) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Computing the primary decomposition of zero-dimensional ideals (Q1864896) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Shrinking integer lattices (Q1896343) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- LLL-reduction for integer knapsacks (Q1928499) (← links)
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA (Q1934238) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Three-loop anomalous dimension of the non-singlet transversity operator in QCD (Q1949616) (← links)
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions (Q1961373) (← links)
