363 search results - page 3 / 73 » Code Generation for Polynomial Multiplication |
CHES
2001
Springer
13 years 12 months ago
2001
Springer
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
JOC
2010
13 years 2 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 ...
ICISC
2004
13 years 8 months ago
2004
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 ...
ADHOCNETS
2009
Springer
13 years 10 months ago
2009
Springer
This paper is a sequel of previous work, in which we have studied the traffic management problem in UMTS. The main objective was to improve the spectral efficiency of cellular netw...
ACMSE
2006
ACM
13 years 11 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...