Sciweavers

TC
2002
14 years 2 days ago
Finite Field Multiplier Using Redundant Representation
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...
MOC
2002
121views more  MOC 2002»
14 years 3 days ago
Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
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...
Andreas Enge
ECCC
2000
93views more  ECCC 2000»
14 years 8 days ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
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...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
COMBINATORICS
2004
84views more  COMBINATORICS 2004»
14 years 9 days ago
q-Exponential Families
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...
Kent E. Morrison
AAECC
2002
Springer
98views Algorithms» more  AAECC 2002»
14 years 9 days 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
TC
2008
14 years 11 days ago
High-Performance Architecture of Elliptic Curve Scalar Multiplication
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...
B. Ansari, M. A. Hasan
CORR
2006
Springer
84views Education» more  CORR 2006»
14 years 14 days ago
A simple generalization of El-Gamal cryptosystem to non-abelian groups
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...
Ayan Mahalanobis
FOCM
2008
77views more  FOCM 2008»
14 years 15 days ago
Modular Counting of Rational Points over Finite Fields
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 ...
Daqing Wan
FFA
2008
53views more  FFA 2008»
14 years 15 days ago
Bilinear character sums over elliptic curves
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
Igor Shparlinski
CORR
2010
Springer
166views Education» more  CORR 2010»
14 years 16 days ago
On Exponential Sums, Nowton identities and Dickson Polynomials over Finite Fields
Let Fq be a finite field, Fqs be an extension of Fq, let f(x) Fq[x]
Xiwang Cao, Lei Hu