scientific article; zbMATH DE number 3265895

zbMath0166.04901MaRDI QIDQ5550483

Elwyn R. Berlekamp

Publication date: 1967

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

commutative algebra

Related Items

Factoring sparse multivariate polynomials, An application of factoring, Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝, Irreducibility of multivariate polynomials, A new efficient factorization algorithm for polynomials over small finite fields, An application of algebraic geometry to encryption: tame transformation method, Factoring multivariate polynomials via partial differential equations, Deterministic root finding over finite fields using Graeffe transforms, An Improved Multivariate Polynomial Factoring Algorithm, Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\), Extremal quasi-cyclic self-dual codes over finite fields, Factoring polynomials and primitive elements for special primes, Bounded-degree factors of lacunary multivariate polynomials, Computer algebra: Past and future, Univariate polynomial factorization over finite fields, Algebraic Cryptanalysis of Yasuda, Takagi and Sakurai’s Signature Scheme, An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, Splitting quaternion algebras over quadratic number fields, Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\), A cryptographic system based on finite field transforms, Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials, Univariate polynomial factorization over finite fields with large extension degree, Computing primitive idempotents in finite commutative rings and applications, Methodologies of Symbolic Computation, Factorization of Polynomials Over Finite Fields, Computing the periods of preimages in surjective cellular automata, Interactions of computational complexity theory and mathematics, A note on Gao's algorithm for polynomial factorization, On Bivariate Polynomial Factorization over Finite Fields, Is every matrix similar to a polynomial in a companion matrix?, Macsyma: A personal history, Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields, Efficiently factoring polynomials modulo \(p^4\), Factoring Multivariate Polynomials over Algebraic Number Fields, A heuristic irreducibility test for univariate polynomials, A verified implementation of the Berlekamp-Zassenhaus factorization algorithm, A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\), Foreword, Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\), Characterization and enumeration of good punctured polynomials over finite fields, A note on Gröbner bases and Berlekamp's algorithm, Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields, Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes, Factoring polynomials over finite fields: A survey, On the deterministic complexity of factoring polynomials, Factoring Polynomials Over Large Finite Fields, Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, A deterministic version of Pollard’s $p-1$ algorithm, On the Complexity of the Montes Ideal Factorization Algorithm, Theory of computational complexity. Part 9. Transl. from the Russian., A new approach to the symbolic factorization of multivariate polynomials, Unnamed Item, The black-box Niederreiter algorithm and its implementation over the binary field, Primary decomposition of zero-dimensional ideals over finite fields, Factoring Multivariate Polynomials over Large Finite Fields, Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules, Recent Developments in Multivariate Public Key Cryptosystems, Computation of orders and cycle lengths of automorphisms of finite solvable groups, On the factorization of polynomials, A Highly Scalable RFID Authentication Protocol, On Hensel factorization. I, Factoring Multivariate Polynomials Over the Integers, \(\sqrt{2}+\sqrt{3}\): Four different views, Factoring polynomials over arbitrary finite fields, The decomposition theorem for ideals in polynomial rings over a domain, A key exchange protocol relying on polynomial maps, Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter, Trading GRH for algebra: Algorithms for factoring polynomials and related structures, Subspaces and polynomial factorizations over finite fields, Iterative root approximation in \(p\)-adic numerical analysis, A conversion algorithm for logarithms on \(GF(2^n)\), Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\), Factorization of polynomials and some linear-algebra problems over finite fields, MACSYMA from F to G, Finding maximal orders in semisimple algebras over \(\mathbb{Q}\), Polynomial factorization over ${\mathbb F}_2$