### Table 4: Comparison of CED architectures of 128-bit symmetric encryption algorithms

2001

"... In PAGE 4: ... Since there are no inverse operations involved, the only way of applying operation level CED will be to duplicate hardware, which is costly and hence not implemented. Table4 summarizes the performance and fault detection latency in terms of clock cycles for different CED architectures of AES encryption algorithms. The duration of ... ..."

Cited by 1

### Table 4: Comparison of CED architectures of 128-bit symmetric encryption algorithms

2001

"... In PAGE 4: ... Since there are no inverse operations involved, the only way of applying operation level CED will be to duplicate hardware, which is costly and hence not implemented. Table4 summarizes the performance and fault detection latency in terms of clock cycles for different CED architectures of AES encryption algorithms. The duration of ... ..."

Cited by 1

### TABLE IX A PERFORMANCE COMPARISON OF THE EME MODE OF OPERATION USING SEVERAL AES ENCRYPTION CORES IMPLEMENTED IN SOFTWARE VS. OUR EME RECONFIGURABLE HARDWARE DESIGN.

### Table 14: Default Symmetric Encryption

"... In PAGE 6: ... Of those that supported both, 5469 (29 percent of all servers) chose MD5. As shown in Table14 , none of the servers chose RC2 from the available symmetric encryption algorithms. However, 657 servers that support AES (namely about 6 percent of those that support AES) did not choose AES by default.... ..."

### (Table 2, step 2), then the customer submits the pay- ment to the trusted agent (step 3). The trusted agent may then notify the vendor and get the encryption key from the vendor (step 4). The exchange ends when the TA sends the encryption key to the customer and pay- ment to the vendor, as shown in step 5 and 6 respec- tively. Note that the deliveries of the encrypted goods and encryption key should be done in private. Any traditional symmetric-key algorithms such as DES and IDEA could be used for encryption.

1997

Cited by 5

### Table 1. Reconfiguration time

in Architecture of a Reconfigurable Processor for Implementing Search Algorithms over Discrete Matrices

2003

"... In PAGE 9: ... The results [35] have shown that the utilized universal circuits of reprogrammable FSMs require similar hardware resources and their timing characteristics are comparable with uniquely designed FSM circuits that cannot be reused. Table1 presents the time required for dynamic loading of memory blocks with different parameters through the second port. Table 1.... In PAGE 9: ...The working frequency for the FPGA XCV812E to be used for experiments was set to 30 MHz. The first line of Table1 contains the required time for reloading the segment register, which activates the required group of RAM segments [35,36]. The other lines show the loading time for RAM blocks.... ..."

Cited by 4

### Table 1. Principal characteristics of the reconfigurable hardware SAT solvers

2003

"... In PAGE 4: ... 3 Analysis of Hardware SAT Solvers In this section we attempt to analyze the reconfigurable hardware SAT solvers according to such criteria as algorithmic issues, programming model, execution model, reconfiguration modes, logic capacity and performance. Table1 summarizes the respective characteristics of the architectures considered in the previous section. 3.... ..."

Cited by 9

### Table 1: Area, speed, hardware overhead and reconfigurability of different adders.

### Table 1: Operations used by 128-bit symmetric encryption algorithms

2001

"... In PAGE 3: ... Operations used in a round of Rijndael are: a non- linear byte substitution operation (byte sub), a cyclic left shift of the rows in the state (shift row), GF (28) multiplication with a constant of every column of the state (mix column) and exclusive-or of round key with the state (key-xor). Table1 summarizes various operations used by these symmetric encryption algorithms in their encryption rounds. We have tried to present the operations in the order they are used within a round.... ..."

Cited by 1

### Table 1: Operations used by 128-bit symmetric encryption algorithms

2001

"... In PAGE 3: ... Operations used in a round of Rijndael are: a non- linear byte substitution operation (byte sub), a cyclic left shift of the rows in the state (shift row), GF (28) multiplication with a constant of every column of the state (mix column) and exclusive-or of round key with the state (key-xor). Table1 summarizes various operations used by these symmetric encryption algorithms in their encryption rounds. We have tried to present the operations in the order they are used within a round.... ..."

Cited by 1