...lengths.

A table of DES speeds for various processor platforms is given in [Sch94, p 131].

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...hours.

The current RSA challenge offers a reward of $10,000 for the successful brute-force solution of a posted ciphertext/plaintext pair. Current co-operative software-only approaches seem to require at least 4 years of processing time to achieve a solution.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...operations

Bit-wise AND, OR, XOR, shift and rotation

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...generated.

The Synopsys compiler tends to be rather literal with its input stream; dead code will be translated into hardware despite being computationally useless.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...ever).

The ``merge node'' is the dominator tree child of the conditional branch, which is reached last in a post-order depth-first-search of the control flow graph.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...state-encoding,

Galloway indicates in [Gal95], citing [BFS94], that, despite its simplicity, one-hot encoding may be the best encoding to use on FPGAs. See also [POA96], who reference [Wak90].

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...$100.

Wiener assumes quatities of 10,000; the Xilinx price quote is for a -2 grade part in quantity 100.
(Ed. note: In March 1998 Xilinx prices have fallen to the $30 range for qty 10k; however, we might fairly assume that Wiener's chip costs have taken a similar plunge.)

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.