On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
From MaRDI portal
Publication:2852140
DOI10.1515/dma-2013-001zbMath1283.94160OpenAlexW2321603290MaRDI QIDQ2852140
Sergey B. Gashkov, Igor S. Sergeev
Publication date: 8 October 2013
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma-2013-001
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
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 ⋮ Unnamed Item
This page was built for publication: On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
