205 search results - page 3 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
STOC
1995
ACM
13 years 9 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
ASIACRYPT
1999
Springer
13 years 10 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
TC
2008
13 years 5 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...