25 search results - page 5 / 5 » Generating series for irreducible polynomials over finite fi... |
STOC
2009
ACM
14 years 5 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
COMBINATORICS
2006
13 years 5 months ago
2006
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
ENC
2004
IEEE
13 years 9 months ago
2004
IEEE
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
JSC
2008
13 years 5 months ago
2008
In this paper we study standard bases for submodules of K[[t1, . . . , tm]][x1, . . . , xn]s respectively of their localisation with respect to a t-local monomial ordering. The mai...
TIT
2008
13 years 5 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...