1400 search results - page 17 / 280 » On multiplication in finite fields |
94
Voted
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
139
Voted
ISSAC
2009
Springer
16 years 5 days ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
189
click to vote
ISCAS
2008
IEEE
16 years 16 hour ago
2008
IEEE
— Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered ...
149
Voted
FOCS
2007
IEEE
15 years 12 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...