Pages that link to "Item:Q1165896"
From MaRDI portal
The following pages link to Factoring polynomials with rational coefficients (Q1165896):
Displaying 50 items.
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
- Lattice Identification and Separation: Theory and Algorithm (Q5109287) (← links)
- Sampling of entire functions of several complex variables on a lattice and multivariate Gabor frames (Q5132205) (← links)
- A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems (Q5139657) (← links)
- On the Consistent Path Problem (Q5144803) (← links)
- The distribution of $k$-free numbers (Q5145103) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- The History of the LLL-Algorithm (Q5188537) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- Selected Applications of LLL in Number Theory (Q5188543) (← links)
- The van Hoeij Algorithm for Factoring Polynomials (Q5188544) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance (Q5188548) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- LLL reduction and a conjecture of Gunnells (Q5189165) (← links)
- A Numerical Transcendental Method in Algebraic Geometry: Computation of Picard Groups and Related Invariants (Q5203819) (← links)
- Diophantine equations coming from binomial near-collisions (Q5221071) (← links)
- Benchmark Problems for Phase Retrieval (Q5230417) (← links)
- Testing Isomorphism of Lattices over CM-Orders (Q5232327) (← links)
- Singular Value Decomposition of Complexes (Q5234536) (← links)
- Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- (Q5239646) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- On the Structure of Reduced Kernel Lattice Bases (Q5244870) (← links)
- Algorithmic Construction of Hurwitz Maps (Q5246361) (← links)
- Computing Maximal Copies of Polyhedra Contained in a Polyhedron (Q5246363) (← links)
- Linear relations of zeroes of the zeta-function (Q5246854) (← links)
- Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values (Q5249301) (← links)
- Calculating “Small” Solutions of Relative Thue Equations (Q5264647) (← links)
- A Brief History of Pairings (Q5267789) (← links)
- Deciding Orthogonality in Construction-A Lattices (Q5270405) (← links)
- Etude Algorithmique de Réseaux Construits avec la Forme Trace (Q5285861) (← links)
- Majoration de la norme des facteurs d'un polynôme : cas où toutes les racines du polynôme sont réelles (Q5286059) (← links)
- Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry (Q5298836) (← links)
- Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format (Q5302769) (← links)
- An Optimization Problem for Lattices (Q5415568) (← links)
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs (Q5418497) (← links)
- Divisors in residue classes, constructively (Q5429512) (← links)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? (Q5445445) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- RSA Moduli with a Predetermined Portion: Techniques and Applications (Q5458502) (← links)
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) (Q5458537) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)
- Determination of all rational preperiodic points for morphisms of PN (Q5497024) (← links)
- Computing prime divisors in an interval (Q5497026) (← links)
- Computing Power Series Expansions of Modular Forms (Q5498951) (← links)
- Computing algebraic numbers of bounded height (Q5501149) (← links)
- String Reconstruction from Substring Compositions (Q5502098) (← links)