Factoring Polynomials Over Large Finite Fields
From MaRDI portal
Cites work
- Algebraic coding theory
- An Irreducibility Criterion for Polynomials Over the Integers
- Computing Multiplicative Inverses in GF(p)
- Factorization of the General Polynomial by Means of Its Homomorphic Congruential Functions
- scientific article; zbMATH DE number 3124064 (Why is no real title available?)
- scientific article; zbMATH DE number 3001304 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- scientific article; zbMATH DE number 3099537 (Why is no real title available?)
- On Character Sums and Primitive Roots†
- On Hensel factorization. I
- On inverses of Vandermonde and confluent Vandermonde matrices
- On the irreducibility of certain polynomials
- ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELD
- On the solution of algebraic equations over finite fields
Cited in
(only showing first 100 items - show all)- Permutation group approach to association schemes
- A secure and scalable group key exchange system
- Factoring multivariate polynomials over finite fields
- Algebraic algorithms in GF(q)
- Factoring sparse multivariate polynomials
- Irreducibility of multivariate polynomials
- Factoring polynomials and primitive elements for special primes
- Univariate polynomial factorization over finite fields
- Algebraic theory of block codes detecting independent errors
- A cryptographic system based on finite field transforms
- A cryptosystem for multiple communication
- An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
- Uniform complexity and digital signatures
- Smoothness and factoring polynomials over finite fields
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- An introduction to randomized algorithms
- A heuristic irreducibility test for univariate polynomials
- A new approach to the symbolic factorization of multivariate polynomials
- Fast rectangular matrix multiplication and applications
- Sentences over integral domains and their computational complexities
- Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\)
- On the CM character of the curves \(y^ 2=x^ q-1\)
- A modular method for computing the Galois groups of polynomials
- Short presentations for finite groups
- Massively parallel search for linear factors in polynomials with many variables
- Massively parallel factorizations of polynomials with many non-commuting variables
- Verification of the Miller-Rabin probabilistic primality test.
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- Optimal forgeries against polynomial-based MACs and GCM
- EFLASH: a new multivariate encryption scheme
- Two varieties of finite automaton public key cryptosystem and digital signatures
- Deterministic irreducibility testing of polynomials over large finite fields
- Randomised algorithms
- A conversion algorithm for logarithms on \(GF(2^n)\)
- Mathematical problems in cryptology
- Efficient decomposition of associative algebras over finite fields
- A fast parallel sparse polynomial GCD algorithm
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Computation of orders and cycle lengths of automorphisms of finite solvable groups
- On the effect of projection on rank attacks in multivariate cryptography
- Non-malleable functions and their applications
- Succinct non-interactive arguments via linear interactive proofs
- All in the \(C^*\) family
- Complexity of solving parametric polynomial systems
- How should we solve search problems privately?
- Equivalence of polynomial identity testing and polynomial factorization
- Computing Frobenius maps and factoring polynomials
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- A note on Gröbner bases and Berlekamp's algorithm
- Lower bounds for non-black-box zero knowledge
- Theory of computational complexity. Part 9. Transl. from the Russian.
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
- Computing the structure of finite algebras
- A relative van Hoeij algorithm over number fields
- Polynomial factorization algorithms over number fields
- Random sampling in computational algebra: Helly numbers and violator spaces
- Sublinear root detection and new hardness results for sparse polynomials over finite fields
- Algebraic cryptanalysis of Yasuda, Takagi and Sakurai's signature scheme
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Deterministic root finding over finite fields using Graeffe transforms
- On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
- Primary decomposition of zero-dimensional ideals over finite fields
- On a family of preimage-resistant functions
- Implementation of McEliece based on quasi-dyadic Goppa codes for embedded devices
- Chosen ciphertext attack on ZHFE
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Elliptic Curves and Primality Proving
- Polynomial factorization over ${\mathbb F}_2$
- Factoring Multivariate Polynomials over Large Finite Fields
- McEliece Cryptosystem Implementation: Theory and Practice
- A New Algorithm for Factoring Polynomials Over Finite Fields
- The Distribution of Lucas and Elliptic Pseudoprimes
- Factoring Multivariate Polynomials Over the Integers
- Factoring Multivariate Polynomials over Algebraic Number Fields
- An Improved Multivariate Polynomial Factoring Algorithm
- Reconstructing Algebraic Functions from Mixed Data
- Power roots of polynomials over arbitrary fields
- Subquadratic-time factoring of polynomials over finite fields
- scientific article; zbMATH DE number 3433825 (Why is no real title available?)
- On the discrete logarithm problem in finite fields of fixed characteristic
- Break finite automata public key cryptosystem
- Factoring multivariate polynomials via partial differential equations
- On the Complexity of the Montes Ideal Factorization Algorithm
- Recent developments in multivariate public key cryptosystems
- Factoring polynomials over finite fields
- Multi-round secure light-weight broadcast exclusion protocol with pre-processing
- scientific article; zbMATH DE number 7559413 (Why is no real title available?)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- scientific article; zbMATH DE number 7204372 (Why is no real title available?)
- Using zeta functions to factor polynomials over finite fields
- A generalized successive resultants algorithm
- Deterministic root finding in finite fields
- On Bivariate Polynomial Factorization over Finite Fields
- Modular polynomials via isogeny volcanoes
- Character sums and deterministic polynomial root finding in finite fields
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Factoring polynomials over special finite fields
- Factoring polynomials over finite fields: A survey
- On the deterministic complexity of factoring polynomials
This page was built for publication: Factoring Polynomials Over Large Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659665)
