97 search results - page 15 / 20 » Polynomial Multiplication over Finite Fields Using Field Ext... |
PKC
1998
Springer
13 years 10 months ago
1998
Springer
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...
JOC
2010
13 years 1 months ago
2010
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
ISLPED
1997
ACM
13 years 10 months ago
1997
ACM
We propose a pipelined division architecture for low-power ECC applications, which is based on partialdivision on group basis and lookahead technique exploiting the linearity in f...
CHES
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...