Pages that link to "Item:Q3225172"

The following pages link to Fast Polynomial Factorization and Modular Composition (Q3225172):

Displaying 49 items.

• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
• Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
• Modular composition modulo triangular sets and applications (Q371190) (← links)
• Modular composition via factorization (Q722764) (← links)
• Fast arithmetic in unramified \(p\)-adic fields (Q973961) (← links)
• Fast algorithm of square rooting in some finite fields of odd characteristic (Q1725540) (← links)
• Related-key security for pseudorandom functions beyond the linear barrier (Q1994635) (← links)
• Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
• Fast computation of generic bivariate resultants (Q1996880) (← links)
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
• Subquadratic-time algorithms for normal bases (Q2040602) (← links)
• A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
• Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
• On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves (Q2100582) (← links)
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
• Directed evaluation (Q2192677) (← links)
• Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems (Q2211202) (← links)
• Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
• Fast amortized multi-point evaluation (Q2238846) (← links)
• Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
• Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants (Q2272599) (← links)
• Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
• Accelerated tower arithmetic (Q2338646) (← links)
• On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
• On the complexity exponent of polynomial system solving (Q2658549) (← links)
• Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (Q2666933) (← links)
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
• Taking roots over high extensions of finite fields (Q2862538) (← links)
• Finding roots in with the successive resultants algorithm (Q2878836) (← links)
• Algebraic Cryptanalysis of Yasuda, Takagi and Sakurai’s Signature Scheme (Q2942826) (← links)
• Counting points on hyperelliptic curves of genus 2 with real models (Q3121431) (← links)
• Sato-Tate distributions (Q3295946) (← links)
• Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
• Computing the Distance between Piecewise-Linear Bivariate Functions (Q4962199) (← links)
• Fast computation of elliptic curve isogenies in characteristic two (Q5034139) (← links)
• (Q5111865) (← links)
• Deterministic polynomial factoring and association schemes (Q5170254) (← links)
• Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
• A Generalised Successive Resultants Algorithm (Q5267797) (← links)
• A fast algorithm for reversion of power series (Q5497035) (← links)
• Character sums and deterministic polynomial root finding in finite fields (Q5501155) (← links)
• VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets (Q5857774) (← links)
• Identification protocols and signature schemes based on supersingular isogeny problems (Q5919490) (← links)
• Optimal Las Vegas reduction from one-way set reconciliation to error correction (Q5964019) (← links)
• Irreducibility of Binomials (Q6047986) (← links)
• Univariate polynomial factorization over finite fields with large extension degree (Q6122401) (← links)
• High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
• Counting roots for polynomials modulo prime powers (Q6165864) (← links)
• Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)