Sciweavers

1400 search results - page 43 / 280
» On multiplication in finite fields
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 8 months ago
Group representation design of digital signals and sequences
In this survey a novel system, called the oscillator system, consisting of order of p3 functions (signals) on the finite field Fp, is described and studied. The new functions are p...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
JOC
2006
103views more  JOC 2006»
13 years 8 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
AAECC
2002
Springer
126views Algorithms» more  AAECC 2002»
13 years 8 months ago
Toric Varieties Hirzebruch Surfaces and Error-Correcting Codes
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
Johan P. Hansen
DCC
2006
IEEE
14 years 8 months ago
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. ...
PKC
1998
Springer
123views Cryptology» more  PKC 1998»
14 years 10 days ago
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
Jung Hee Cheon, Sung-Mo Park, Sangwoo Park, Daeho ...