Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. (July 2021)

• Record Type: Journal Article
• Authors: Doliskani, Javad; Narayanan, Anand Kumar; Schost, Éric
• Is Part Of: Journal of symbolic computation. Volume 105(2021)
• Page Start: 199
• Page End: 213
• Publication Date: 2021-07
• Subjects: Elliptic modules -- Drinfeld modules -- Polynomial factorization -- Hasse invariant -- Complex multiplication; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2020.06.007
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: We present a novel randomized algorithm to factor polynomials over a finite field F q of odd characteristic using rank 2 Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial f ∈ F q [ x ] to be factored) with respect to a random Drinfeld module ϕ with complex multiplication. Factors of f supported on prime ideals with supersingular reduction at ϕ have vanishing Hasse invariant and can be separated from the rest. Incorporating a Drinfeld module analogue of Deligne's congruence, we devise an algorithm to compute the Hasse invariant lift, which turns out to be the crux of our algorithm. The resulting expected runtime of n 3 / 2 + ε ( log ⁡ q ) 1 + o ( 1 ) + n 1 + ε ( log ⁡ q ) 2 + o ( 1 ) to factor polynomials of degree n over F q matches the fastest previously known algorithm, the Kedlaya-Umans implementation of the Kaltofen-Shoup algorithm.