Pages that link to "Item:Q1165896"
From MaRDI portal
The following pages link to Factoring polynomials with rational coefficients (Q1165896):
Displaying 42 items.
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
- Cryptography based on transcendental numbers (Q6570949) (← links)
- Improved Herrmann-May's attack with merging variables and lower LLL bound (Q6575047) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
- On the properties of reduced basis related to lattice-reduced algorithm (Q6585461) (← links)
- An ADMM based method for underdetermined box-constrained integer least squares problems (Q6586913) (← links)
- Effective homology and periods of complex projective hypersurfaces (Q6590638) (← links)
- Solutions to a Pillai-type equation involving tribonacci numbers and \(S\)-units (Q6591069) (← links)
- On the probability of generating a primitive matrix (Q6595060) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency (Q6595849) (← links)
- Integrability and complexity in quantum spin chains (Q6600308) (← links)
- Efficient algorithms for finite \(\mathbb{Z}\)-algebras (Q6601470) (← links)
- A robust implementation for solving the \(S\)-unit equation and several applications (Q6603857) (← links)
- Effective obstruction to lifting Tate classes from positive characteristic (Q6603865) (← links)
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith (Q6604865) (← links)
- Too many hints -- when LLL breaks LWE (Q6604869) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
- An algorithm for solving the principal ideal problem with subfields (Q6605891) (← links)
- Hadamard products and BPS networks (Q6609315) (← links)
- Diffraction measures and patterns of the complex dimensions of self-similar fractal strings. I: The lattice case (Q6610207) (← links)
- Rational approximations, multidimensional continued fractions, and lattice reduction (Q6611636) (← links)
- New absolute irreducibility testing criteria and factorization of multivariate polynomials (Q6616847) (← links)
- On the discrete logarithm problem in the ideal class group of multiquadratic fields (Q6619932) (← links)
- Generalized implicit factorization problem (Q6620059) (← links)
- Multivariate correlation attacks and the cryptanalysis of LFSR-based stream ciphers (Q6632040) (← links)
- On the possibility of a backdoor in the Micali-Schnorr generator (Q6635756) (← links)
- Key recovery attack on the partial Vandermonde knapsack problem (Q6637720) (← links)
- Further improvements of the estimation of key enumeration with applications to solving LWE (Q6643252) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
- On the SVP for low-dimensional circulant lattices (Q6645172) (← links)
- On the Diophantine equation \(2^s + p^k = m^2\) with a Fermat prime \(p\) (Q6651551) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves (Q6652968) (← links)
- Space-efficient and noise-robust quantum factoring (Q6652983) (← links)
- On counterexamples to the Mertens conjecture (Q6653357) (← links)
- On the quantum security of high-dimensional RSA protocol (Q6657369) (← links)
- Finding integral points on elliptic curves over imaginary quadratic fields (Q6660935) (← links)
- Solving norm equations in global function fields (Q6660938) (← links)
- Smooth subsum search a heuristic for practical integer factorization (Q6660954) (← links)
- Computer algebra in the service of enumerative combinatorics (Q6666511) (← links)
