Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
Résumé
We prove that for a fixed prime p, polynomials in F p [X] of degree n may be multiplied in O(n log n 4 log * n) bit operations. Previously, the best known bound was O(n log n 8 log * n).
Domaines
Logiciel mathématique [cs.MS]Origine | Fichiers produits par l'(les) auteur(s) |
---|