Pages that link to "Item:Q1165896"
From MaRDI portal
The following pages link to Factoring polynomials with rational coefficients (Q1165896):
Displaying 50 items.
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits (Q5502751) (← links)
- A New Class of Weak Encryption Exponents in RSA (Q5504634) (← links)
- How can we solve a linear Diophantine equation by the basis reduction algorithm (Q5699920) (← links)
- Short Generators Without Quantum Computers: The Case of Multiquadratics (Q5738870) (← links)
- Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- Small CRT-Exponent RSA Revisited (Q5738972) (← links)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
- On the reduction of a random basis (Q5851031) (← links)
- Faster Homomorphic Evaluation of Discrete Fourier Transforms (Q5854442) (← links)
- A Unified Method for Private Exponent Attacks on RSA Using Lattices (Q5859736) (← links)
- A Vectorized, Cache Efficient LLL Implementation (Q5862555) (← links)
- On ideal class group computation of imaginary multiquadratic fields (Q5871436) (← links)
- Saturation of finitely-generated submodules of free modules over Prüfer domains (Q5872904) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals (Q5878296) (← links)
- Salem numbers with minimal trace (Q5886875) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Finding smooth integers in short intervals using CRT decoding (Q5894822) (← links)
- Foreword (Q5918134) (← links)
- Linear programming using limited-precision oracles (Q5918922) (← links)
- Galois group computation for rational polynomials (Q5927989) (← links)
- Explicit Galois realization of transitive groups of degree up to 15 (Q5927990) (← links)
- A polynomial with Galois group \(\text{SL}_2(11)\) (Q5927992) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- Sampling the Riemann-theta Boltzmann machine (Q6040125) (← links)
- A new attack on some RSA variants (Q6040631) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- Quantum mechanics of bipartite ribbon graphs: integrality, lattices and Kronecker coefficients (Q6042827) (← links)
- Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight (Q6043377) (← links)
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- Lattice Sieving via Quantum Random Walks (Q6045073) (← links)
- A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)
- Algebraic number fields and the LLL algorithm (Q6051125) (← links)
- Complex hyperbolic and projective deformations of small Bianchi groups (Q6053477) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- Practical attacks on small private exponent RSA: new records and new insights (Q6070359) (← links)
- Higher polynomial identities for mutations of associative algebras (Q6078328) (← links)
- All shall FA-LLL: breaking CT-RSA 2022 and CHES 2022 infective countermeasures with lattice-based fault attacks (Q6080920) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- On the hardness of the finite field isomorphism problem (Q6083668) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications (Q6091132) (← links)
- Counting rational points of a Grassmannian (Q6097053) (← links)
