Factoring multivariate polynomials over finite fields

No abstract is available for this paper.

• Publication year

  1983

• Venue

  Journal of computer and system sciences (Print)

• Publication date

  1983-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/800061.808748
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields

  1983cited by this paper
• Factoring polynomials with rational coefficients

  1982influential reference
• The Subresultant PRS Algorithm

  1978influential reference
• The Design and Analysis of Computer Algorithms

  1974cited by this paper
• The Hensel Lemma in Algebraic Manipulation

  1973cited by this paper
• Factoring polynomials over large finite fields*

  1970cited by this paper
• Sylvester’s identity and multistep integer-preserving Gaussian elimination

  1968cited by this paper
• Systems of distinct representatives and linear algebra

  1967cited by this paper
• An Analogue to Minkowski's Geometry of Numbers in a Field of Series

  1941cited by this paper

• A new criterion for the absolute irreducibility of multivariate polynomials over finite fields

  2026cites this paper
• Minima successifs des r\'eseaux et pentes des fibr\'es vectoriels sur les corps de fonctions globaux

  2025cites this paper
• Deterministic list decoding of Reed-Solomon codes

  2025cites this paper
• Polynomial Lattices for the BIKE Cryptosystem

  2025cites this paper
• Encounters in Symbolic Computation: Ideas for the Ages

  2024cites this paper
• decoding for

  2022cites this paper
• Local Statistics for Zeros of Artin-Schreier L-functions

  2021cites this paper
• Preuves de protocoles cryptographiques : méthodes symboliques et attaquants puissants. (Proofs of security protocols : symbolic methods and powerful attackers)

  2020cites this paper
• Coding for Polymer-Based Data Storage

  2020cites this paper
• Explicit isomorphisms of quaternion algebras over quadratic global fields

  2020cites this paper
• Polynomial Factorization 1982–1986

  2020cites this paper
• Robust Schur Stability of a Polynomial Matrix Family

  2019cites this paper
• Digital WPI Major Qualifying Projects ( All Years ) Major Qualifying Projects April 2009 Authentication Schemes based on Physically Unclonable Functions

  2019cites this paper
• Automated applications of Cryptographic Assumptions

  2018cites this paper
• Symbolic Proofs for Lattice-Based Cryptography

  2018cites this paper
• Cryptanalysis of 4-Bit Crypto S-Boxes in Smart Applications

  2018cites this paper
• Construction and decoding of evaluation codes in hamming and rank metric

  2018cites this paper
• Mathematical Method to Search for Monic Irreducible Polynomials with Decimal Equivalents of Polynomials over Galois Field GF(pq)

  2017cites this paper
• Pade approximants and key lattices for decoding alternant codes

  2016cites this paper
• On the decidability of the theory of modules over the ring of algebraic integers

  2016cites this paper
• Algorithms for Simultaneous Padé Approximations

  2016cites this paper
• May 08, 2020 Row Reduction Applied to Decoding of Rank Metric

  2015cites this paper
• Linear Relations between Multizeta Values

  2015cites this paper
• Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\m

  2015influential citation
• Solving Shift Register Problems over Skew Polynomial Rings using Module Minimisation

  2015cites this paper
• Row reduction applied to decoding of rank-metric and subspace codes

  2015cites this paper
• Lattices over polynomial Rings and Applications to Function Fields

  2014cites this paper
• Polynomial Datapaths Optimization

  2014cites this paper
• Lattices over Polynomial Rings and Applications to Function Fields

  2014influential citation
• Solving generalised Padé approximations over polynomial rings

  2014cites this paper
• Applications of strong Grobner bases over Euclidean domains

  2013influential citation
• Generalised Multi-sequence Shift-Register synthesis using module minimisation

  2013cites this paper
• On decoding Interleaved Chinese Remainder codes

  2013cites this paper
• Handbook of Finite Fields

  2013cites this paper
• Multi-trial Guruswami–Sudan decoding for generalised Reed–Solomon codes

  2013cites this paper
• List Decoding of Algebraic Codes

  2013cites this paper
• Factorization of multivariate polynomials

  2013cites this paper
• A modified LLL algorithm for change of ordering of Grobner basis

  2013cites this paper
• Truth Table Minimization of Computational Models

  2013cites this paper
• On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes

  2012cites this paper
• Genus computation of global function fields

  2012cites this paper
• Complexity of solving parametric polynomial systems

  2011cites this paper
• A lattice-based minimal partial realization algorithm for matrix sequences of varying length

  2011cites this paper
• List Decoding for Binary Goppa Codes

  2011cites this paper
• A note on Gao's algorithm for polynomial factorization

  2011cites this paper
• An efficient lattice reduction method for F2-linear pseudorandom number generators using Mulders and Storjohann algorithm

  2011cites this paper
• Revisiting strong Gröbner bases over Euclidean domains

  2010influential citation
• An empirical study of cache-oblivious polygon indecomposability testing

  2010cites this paper
• Fast lattice reduction for F2-linear pseudorandom number generators

  2010cites this paper
• Exact polynomial factorization by approximate high degree algebraic numbers

  2009cites this paper
• Factoring polynomials and Grobner bases

  2009cites this paper
• F2-Linear Random Number Generators

  2009cites this paper
• Maximally equidistributed pseudorandom number generators via linear output transformations

  2009cites this paper
• A lattice-based linear shift register synthesis for multisequences of varying length

  2008cites this paper
• Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences

  2008cites this paper
• An efficient sparse adaptation of the polytope method over I and a record-high binary bivariate factorisation

  2008cites this paper
• Parallel methods for absolute irreducibility testing

  2008cites this paper
• A Lattice-Based Minimal Partial Realization Algorithm

  2008cites this paper
• MULTIVARIATE LIST DECODING OF EVALUATION CODES WITH A GRÖBNER BASIS PERSPECTIVE

  2008cites this paper
• Computational complexity of sentences over fields

  2008cites this paper
• F 2-Linear Random Number Generators

  2007cites this paper
• Computer Security and Cryptography

  2007cites this paper
• On the Complexity of Counting Irreducible Components and Computing Betti Numbers of Algebraic Varieties

  2007cites this paper
• Finding Points on Curves over Nite Elds Extended Abstract

  2007cites this paper
• Décodage des codes algébriques et cryptographie

  2007cites this paper
• 2 F 2-Linear Generators 2 . 1 General Framework

  2007cites this paper
• Factoring multivariate integral

  2006cites this paper
• The number of solutions of an equation related to a product of multilinear polynomials

  2006cites this paper
• Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes

  2005influential citation
• Factoring polynomials over global fields I

  2005cites this paper
• Construction d'ensembles de points basee sur des recurrences lineaires dans un corps fini de caracteristique 2 pour la simulation Monte Carlo et l'integration quasi-Monte Carlo

  2004cites this paper
• Complexity issues in bivariate polynomial factorization

  2004cites this paper
• Factoring polynomials via polytopes

  2004cites this paper
• Stream cipher based on quasigroup string transformations in Zp*

  2004cites this paper
• Polynomial Integration Lattices

  2004cites this paper
• The arithmetic of certain cubic function fields

  2004influential citation
• Changing the ordering of Gröbner bases with LLL: case of two variables

  2003cites this paper
• Factoring multivariate polynomials via partial differential equations

  2003influential citation
• about the Internet and Networking : 2010 – 2019

  2003cites this paper
• Hardness as randomness: a survey of universal derandomization

  2003cites this paper
• Computing Riemann-Roch Spaces in Algebraic Function Fields and Related Topics

  2002cites this paper
• Arithmetic on superelliptic curves

  2002cites this paper
• Yet another practical implementation of polynomial factorization over finite fields

  2002cites this paper
• Linear Diophantine equations over polynomials and soft decoding of Reed-Solomon codes

  2002influential citation
• Computing Riemann-roch Spaces in Algebraic Function Elds and Related Topics

  2001influential citation
• Coding theory: tutorial & survey

  2001cites this paper
• The Complexity of Factors of Multivariate Polynomials

  2001influential citation
• Computing Riemann-roch Spaces in Algebraic Function Elds and Related Topics

  2001influential citation
• List decoding of error correcting codes

  2001cites this paper
• Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms

  2001cites this paper
• Fast Absolute Irreducibility Testing via Newton Polytopes

  2000cites this paper
• Lattice computations for random numbers

  2000cites this paper
• Decomposition of Polytopes and Polynomials

  2000cites this paper
• Dynamic creation of pseudorandom number generators

  2000cites this paper
• Tables of 64-bit Mersenne twisters

  2000cites this paper
• Sentences over Integral Domains and Their Computational Complexities

  1999cites this paper
• List Decoding of Algebraic-Geometric Codes

  1999cites this paper
• 1 Major Research Results 1 . 1 Polynomial Factorization

  1999cites this paper
• Factorization of multivariate polynomials over finite fields

  1999cites this paper
• Galois Field computations: Implementation of a library and a study of the discrete logarithm problem

  1999cites this paper