A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
Consider a probability measure $\mu$ on $[0, 1]$ and independent identically distributed random variables $X_1,\cdots, X_n$ distributed according to $\mu$. Denote by $Q_n = Q_n (X_1,\cdots, X_n)$ the ...
Consider a probability measure $\mu$ on $[0, 1]$ and independent identically distributed random variables $X_1,\cdots, X_n$ distributed according to $\mu$. Denote by $Q_n = Q_n (X_1,\cdots, X_n)$ the ...
Toward Understanding Exclusive Read
The ability of many processors to simultaneously read from the same cell of shared memory can give additional power to a parallel random access machine. In this paper, a natural Boolean function of $n...
The ability of many processors to simultaneously read from the same cell of shared memory can give additional power to a parallel random access machine. In this paper, a natural Boolean function of $n...
You are not logged in to this journal. Log in
Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
SIAM J. Comput. Volume 19, Issue 4, pp. 711-717 (1990)
Issue Date: 1990
Connotea
CiteULike
del.icio.us
BibSonomy
A normal basis representation of $\operatorname{GF}(2^{n})$ allows squaring to be accomplished by a cyclic shift. Algorithms for multiplication in $\operatorname{GF}(2^{n})$ using a normal basis have been studied by several researchers. In this paper, algorithms for performing exponentiation in $\operatorname{GF}(2^{n})$ using a normal basis, and how they can be speeded up by using parallelization, are investigated.
©1990 Society for Industrial and Applied Mathematics
| History: | Received 1989-03-06; accepted 1989-11-15 |
| Permalink: | http://dx.doi.org/10.1137/0219049 |
KEYWORDS and AMS
68Q25, 12E20
PUBLICATION DATA
0097-5397 (print)
1095-7111 (online)
SIAM