Probabilistic algorithm for finding roots of linearized polynomials

A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented algorithm is O(nt) operations in Fqn . Keywords Linearized polynomials ? Probabilistic algorithms ? Root-finding algorithms ? Symbolic GCD

• Type: Conference
• Year: 2008
• Where: DCC
• Authors: Vitaly Skachek, Ron M. Roth
• Keywords: Computer Graphics, DCC 2008, Keywords Linearized Polynomials, Probabilistic Algorithm, Probabilistic Algorithms