Efficiently Factoring Polynomials Modulo p4

DOI10.1145/3326229.3326233zbMath1467.11113arXiv1901.06628OpenAlexW2963259519MaRDI QIDQ5120485

Rajat Mittal, Nitin Saxena, Ashish Dwivedi

Publication date: 10 September 2020

Published in: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.06628

zbMATH Keywords

rootslocal ringfactor\(p\)-adicefficientrandomizedHensel liftprime-power

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Polynomials, factorization in commutative rings (13P05) Factorization (11Y05)

Related Items (3)

On algorithms to find \(p\)-ordering ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Unnamed Item

This page was built for publication: Efficiently Factoring Polynomials Modulo p4