237 search results - page 9 / 48 » Algorithms for Exponentiation in Finite Fields |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
DCC
2006
IEEE
14 years 7 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...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
SIAMCOMP
2008
13 years 7 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...