97 search results - page 10 / 20 » Polynomial Multiplication over Finite Fields Using Field Ext... |
CHES
2000
Springer
13 years 11 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
TIT
2010
13 years 1 months ago
2010
Abstract. In this note we use Carlitz's lifting formula for Kloosterman sums and some results from the theory of cyclotomic fields to show that a Kloosterman sum over a finite...
DCC
1999
IEEE
13 years 6 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
ICMCS
2010
IEEE
13 years 7 months ago
2010
IEEE
Motion-Compensated Frame Interpolation (MCFI) is a technique used extensively for increasing the temporal frequency of a video sequence. In order to obtain a high quality interpol...