This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhon...
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...
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...
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...
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 ...
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...
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...
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 ...