TC
2002
13 years 4 months ago
2002
This article presents simple and highly regular architectures for finite field multipliers using a redundant representation. The basic idea is to embed a finite field into a cyclo...
MOC
2002
13 years 4 months ago
2002
We provide a subexponential algorithm for solving the discrete logarithm problem in Jacobians of high-genus hyperelliptic curves over finite fields. Its expected running time for i...
ECCC
2000
13 years 4 months ago
2000
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
COMBINATORICS
2004
13 years 4 months ago
2004
We develop an analog of the exponential families of Wilf in which the label sets are finite dimensional vector spaces over a finite field rather than finite sets of positive integ...
AAECC
2002
Springer
13 years 4 months ago
2002
Springer
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 ...
TC
2008
13 years 4 months ago
2008
A high performance architecture of elliptic curve scalar multiplication over finite field GF(2m ) is proposed. A pseudo-pipelined word serial finite field multiplier with word siz...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
In this paper we propose the group of unitriangular matrices over a finite field as a non-abelian group and composition of inner, diagonal and central automorphisms as a group of a...
FOCM
2008
13 years 5 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 ...
FFA
2008
13 years 5 months ago
2008
Let k be a finite field with q elements. Let kn be the extension of k with degree n. Let Nn be the kernel of the norm map Nkn/k : k
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]