A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)

DOI10.1016/j.ipl.2017.01.009zbMath1416.11172OpenAlexW2582438899MaRDI QIDQ509886

Luiz Emilio Allem, Carlos Hoppen

Publication date: 21 February 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.01.009

zbMATH Keywords

algorithmscomputational complexitydesign of algorithms

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Gao's algorithm for polynomial factorization
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
• Irreducibility of multivariate polynomials
• Reducibility of polynomials \(f(x,y)\) modulo \(p\)
• Extracting sparse factors from multivariate integral polynomials
• A new efficient factorization algorithm for polynomials over small finite fields
• Improved dense multivariate polynomial factorization algorithms
• On Hensel factorization. I
• Handbook of Finite Fields
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• Effective Hilbert irreducibility
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Factoring multivariate polynomials via partial differential equations
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)