Sciweavers

237 search results - page 13 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
STOC
2007
ACM
133views Algorithms» more  STOC 2007»
14 years 7 months ago
Interpolation of depth-3 arithmetic circuits with two multiplication gates
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
Amir Shpilka
AAECC
2002
Springer
98views Algorithms» more  AAECC 2002»
13 years 7 months ago
A Polynomial Representation of the Diffie-Hellman Mapping
Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for ...
Wilfried Meidl, Arne Winterhof
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 7 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
MOC
2000
132views more  MOC 2000»
13 years 7 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
JOC
2006
103views more  JOC 2006»
13 years 7 months ago
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2
We present an algorithm to compute the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for ...
Jan Denef, Frederik Vercauteren