Factoring modular polynomials
From MaRDI portal
Publication:1273766
DOI10.1006/jsco.1998.0228zbMath0913.11050OpenAlexW2024250625MaRDI QIDQ1273766
Silke Hartlieb, Joachim von zur Gathen
Publication date: 11 March 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/53f9d93773425dba3815ee27ee879a1d4a06c3dd
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Counting roots for polynomials modulo prime powers ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Unnamed Item ⋮ Noisy polynomial interpolation modulo prime powers ⋮ Randomized polynomial-time root counting in prime power rings ⋮ Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
This page was built for publication: Factoring modular polynomials
