Pages that link to "Item:Q3955477"
From MaRDI portal
The following pages link to A New Algorithm for Factoring Polynomials Over Finite Fields (Q3955477):
Displayed 50 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Is every matrix similar to a polynomial in a companion matrix? (Q445817) (← links)
- Computing conjugating sets and automorphism groups of rational functions (Q479800) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- A public key cryptosystem based on Diophantine equations of degree increasing type (Q740123) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- Computer construction of split Cartan subalgebras (Q875096) (← links)
- On arithmetical algorithms over finite fields (Q910432) (← links)
- On the deterministic complexity of factoring polynomials over finite fields (Q911294) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Factoring polynomials using fewer random bits (Q912919) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Iterative root approximation in \(p\)-adic numerical analysis (Q1049397) (← links)
- Algebraic algorithms in GF(q) (Q1066670) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Towards a soluble quotient algorithm (Q1097350) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- On the degrees of irreducible factors of polynomials over a finite field (Q1297409) (← links)
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\) (Q1311315) (← links)
- Short presentations for finite groups (Q1365014) (← links)
- A generalisation of the Cantor-Zassenhaus algorithm (Q1377270) (← links)
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) (Q1633281) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) (Q1750386) (← links)
- Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules (Q1800711) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- Are fifth-degree equations over \(GF(5^ m)\) solvable by radicals? (Q1908900) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\) (Q2130027) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- The Rabin cryptosystem revisited (Q2349533) (← links)
- On the computation of rational points of a hypersurface over a finite field (Q2360665) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Interval partitions and polynomial factorization (Q2429339) (← links)
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields (Q2457415) (← links)
- A note on Gröbner bases and Berlekamp's algorithm (Q2474859) (← links)
- Computing the structure of finite algebras (Q2640676) (← links)
- Polynomial factorization algorithms over number fields (Q2643570) (← links)
- Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields (Q2719077) (← links)
- Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831) (← links)
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields (Q2871193) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- On a family of preimage-resistant functions (Q3075868) (← links)