1400 search results - page 12 / 280 » On multiplication in finite fields |
FOCM
2008
13 years 7 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
SACRYPT
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This contribution proposes text for possible inclusion in IEEE P1363a specifying storageefficient finite field basis conversion techniques. Like IEEE P1363a, it is writte...
TC
2008
13 years 7 months ago
2008
A novel serial-in parallel-out finite field multiplier using redundant representation is proposed. It is shown that the proposed architecture has either a significantly lower compl...
ANTS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
11 A classical theorem by Ritt states that all the complete decomposition chains of a univariate polynomial satisfying a certain tameness condition have the same length. In this p...