97 search results - page 8 / 20 » Polynomial Multiplication over Finite Fields Using Field Ext... |
CMA
2010
13 years 3 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
CIS
2006
Springer
13 years 10 months ago
2006
Springer
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
ISAAC
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
ICDAR
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper describes a new versatile algorithm for correcting nonlinear distortions, such as curvature of book pages, in camera based document processing. We introduce the idea of...