Pages that link to "Item:Q1165896"
From MaRDI portal
The following pages link to Factoring polynomials with rational coefficients (Q1165896):
Displaying 50 items.
- Algebraic solutions to the connectivity problem for \(m\)-way layouts: Interaction-contrast ali\-asing (Q2474428) (← links)
- Reduction of Smith normal form transformation matrices (Q2487958) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- On shifted Eisenstein polynomials (Q2517642) (← links)
- Peak-power reduction by the lattice-reduction-aided closest point search for MIMO broadcast channels (Q2519418) (← links)
- Cryptanalysis of large RSA exponent by using the LLL algorithm (Q2572356) (← links)
- Advanced determinant calculus: a complement (Q2575011) (← links)
- Some necessary clarifications about the chords' problem and the partial digest problem (Q2576888) (← links)
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) (Q2628124) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Bounded-degree factors of lacunary multivariate polynomials (Q2635075) (← links)
- Six-loop anomalous dimension of twist-two operators in planar \( \mathcal{N}=4 \) SYM theory (Q2635609) (← links)
- Computing with characters of finite groups (Q2639956) (← links)
- Solving conics over functions fields (Q2642775) (← links)
- A relative van Hoeij algorithm over number fields (Q2643532) (← links)
- Polynomial factorization algorithms over number fields (Q2643570) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Scalable revocable identity-based signature over lattices in the standard model (Q2662710) (← links)
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices (Q2666752) (← links)
- Improving small private exponent attack on the Murru-Saettone cryptosystem (Q2672624) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- Abelian lifts of polynomials (Q2681249) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Objective molecular dynamics for atomistic simulation of macroscopic fluid motion (Q2687516) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- On completely factoring any integer efficiently in a single run of an order-finding algorithm (Q2690484) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Cullen numbers in sums of terms of recurrence sequence (Q2696285) (← links)
- Computing torsion subgroups of Jacobians of hyperelliptic curves of genus 3 (Q2696579) (← links)
- A lattice reduction algorithm based on sublattice BKZ (Q2697920) (← links)
- On the (M)iNTRU assumption in the integer case (Q2697921) (← links)
- The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
- Additive Diophantine equations with binary recurrences, \(\mathcal{S}\)-units and several factorials (Q2701319) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte) (Q2744710) (← links)
- Security of the most significant bits of the Shamir message passing scheme (Q2759102) (← links)
- Some computations on the spectra of Pisot and Salem numbers (Q2781224) (← links)
- An Implementation of the Number Field Sieve (Q2785383) (← links)
- Just a Little Bit More (Q2790027) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- How to pick a random integer matrix? (and other questions) (Q2792341) (← links)
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents (Q2794514) (← links)
- Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis (Q2799548) (← links)
- The Diagonal Reduction Algorithm Using Fast Givens (Q2799575) (← links)
