Pages that link to "Item:Q5928877"

The following pages link to Factoring polynomials over finite fields: A survey (Q5928877):

Displaying 37 items.

• Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields (Q429752) (← links)
• The eigenstructure of finite field trigonometric transforms (Q551319) (← links)
• A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
• Fast rectangular matrix multiplication and some applications (Q931517) (← links)
• Efficient \(p\)th root computations in finite fields of characteristic \(p\) (Q1009125) (← links)
• Factoring polynomials over global fields (Q1032662) (← links)
• On the last fall degree of zero-dimensional Weil descent systems (Q1690789) (← links)
• Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
• Computing the bound of an Ore polynomial. Applications to factorization (Q1757021) (← links)
• How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182) (← links)
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
• Permutation polynomials and factorization (Q2040304) (← links)
• Computation of orders and cycle lengths of automorphisms of finite solvable groups (Q2048160) (← links)
• Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
• Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
• Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
• Interval partitions and polynomial factorization (Q2429339) (← links)
• The index calculus method using non-smooth polynomials (Q2719078) (← links)
• Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
• Finding roots in with the successive resultants algorithm (Q2878836) (← links)
• Algebraic Cryptanalysis of Yasuda, Takagi and Sakurai’s Signature Scheme (Q2942826) (← links)
• Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
• Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP (Q3457129) (← links)
• Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
• Computing special powers in finite fields (Q4813594) (← links)
• A solution to certain polynomial equations with applications to nonlinear fitting (Q4821050) (← links)
• (Q5091766) (← links)
• Using zeta functions to factor polynomials over finite fields (Q5236842) (← links)
• A Generalised Successive Resultants Algorithm (Q5267797) (← links)
• Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) (Q6118641) (← links)
• Computing primitive idempotents in finite commutative rings and applications (Q6149152) (← links)
• Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)
• Equal-degree factorization of binomials and trinomials over finite fields (Q6584731) (← links)
• Efficient algorithms for finite \(\mathbb{Z}\)-algebras (Q6601470) (← links)
• Towards a quantum-resistant weak verifiable delay function (Q6619929) (← links)