205 search results - page 37 / 41 » Complexity of Polynomial Multiplication over Finite Fields |
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Graphical models are omnipresent in the software engineering field, but most current graphical modeling languages do not scale with the increasing size and complexity of today...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
DATE
2010
IEEE
14 years 13 days ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
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...