On a quick multiplication in normal bases of finite fields
From MaRDI portal
Publication:4809530
DOI10.1515/dma.2001.11.4.327zbMath1060.12008OpenAlexW2134398350MaRDI QIDQ4809530
A. A. Bolotov, Sergey B. Gashkov
Publication date: 30 August 2004
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.2001.11.4.327
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
On design of circuits of logarithmic depth for inversion in finite fields ⋮ Complexity of computation in finite fields ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Fast algorithm of square rooting in some finite fields of odd characteristic ⋮ On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
This page was built for publication: On a quick multiplication in normal bases of finite fields
