Sciweavers

6 search results - page 2 / 2
» Partial Ovoids in Classical Finite Polar Spaces
Sort
View
TC
2008
13 years 5 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...