Factoring polynomials using fewer random bits
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Equations over finite fields. An elementary approach
- Factoring Polynomials Over Large Finite Fields
- Probabilistic Algorithms in Finite Fields
- The NP-completeness column: An ongoing guide
Cited in
(17)- scientific article; zbMATH DE number 1542868 (Why is no real title available?)
- scientific article; zbMATH DE number 1418483 (Why is no real title available?)
- Factoring a binary polynomial of degree over one million
- Polylog depth circuits for integer factoring and discrete logarithms
- Generating random factored ideals in number fields
- Toward a theory of Pollard's rho method
- Distinct Degree Factorizations for Polynomials over a Finite Field
- scientific article; zbMATH DE number 1643928 (Why is no real title available?)
- Primality testing with fewer random bits
- Bounds on tradeoffs between randomness and communication complexity
- On the security of modular exponentiation with application to the construction of pseudorandom generators
- On Bivariate Polynomial Factorization over Finite Fields
- On the degrees of irreducible factors of polynomials over a finite field
- Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
- On the deterministic complexity of factoring polynomials over finite fields
- Efficient Factoring Based on Partial Information
- Factoring polynomials over finite fields: A survey
This page was built for publication: Factoring polynomials using fewer random bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912919)
