Résumé
Computing the product of a Toeplitz matrix and a vector arises in various applications including cryptography. In this paper, we consider Toeplitz matrices and vectors with entries in $({hbox{rlap{I}kern 2.0pt{hbox{F}}}}_2)$. For improved efficiency in such computations, large Toeplitz matrices and vectors are recursively split and special formulas with subquadratic arithmetic complexity are applied. To this end, we first present a formula for the five-way splitting and then provide a generalization for the $(k)$-way splitting, where $(k)$ is an arbitrary integer. These formulas can be used to compute a Toeplitz matrix-vector product (TMVP) of size $(n)$ with an arithmetic complexity of $(O(n^{log_k(k(k+1)/2)}))$.