### Table 1: Short vector extensions.

2003

Cited by 2

### Table 1. Short vector SIMD extensions.

2003

"... In PAGE 1: ... These extensions provide datatypes and instructions to operate in parallel on short vectors (currently of length 2 or 4) of floating point num- bers. Table1 gives an overview on these extensions. Ex- amples include SSE (4-way single precision) provided by Pentium III/4 and Athlon XP, and SSE2 (2-way dou- ble precision) provided by Pentium 4.... ..."

Cited by 15

### Table 1. Comparison of ST and OT schedules. Application

2000

"... In PAGE 9: ... Thus, our analysis in this section gives a lower bound on the improvement we can expect using the OT implementation strategy in conjunction with our proposed transaction ordering techniques. Table1 compares the performance (iteration period) of the ST and the OT schedules. Here, the average iteration period ( ) of the OT schedule is obtained by taking the best perfor- mance using the algorithms proposed in Sections 4-6, and denotes the average iteration period of the corresponding ST schedule.... ..."

Cited by 5

### Table 1. Comparison of ST and OT schedules. Application

"... In PAGE 29: ... Thus, our analysis in this section gives a lower bound on the improvement we can expect using the OT implementation strategy in conjunction with our proposed transaction ordering tech- niques. Table1 compares the performance (iteration period) of the ST and the OT schedules. Here, the average iteration period () of the OT schedule is obtained by taking the best perfor- mance using the algorithms proposed in Sections 5-7, and denotes the average iteration period of the corresponding ST schedule.... ..."

### Table 2. Protocol for two secrets of ` bits

2001

"... In PAGE 8: ... Therefore, we can conclude saying that Zig-zag and fully Zig-zag de nitions de ne the same class of functions. Therefore, the known constructions for Zig-zag functions enable us to improve the protocol described in Table 1 by substituting the secrets with the pre-images of a Zig- zag functions, as done in the protocol described in Table2 for two secrets. A complete description of our protocol can be found in Table 3.... ..."

Cited by 3

### Table 4: Complexity Comparison for Best Short Keystream Attacks on E0

2006

"... In PAGE 9: ... So far only a few such short key cryptanalysis are known: use of Binary Decision Diagrams [11] or backtracking methods [13] have opened a promising field of cryptanalytic research. Table4 compares complexity of known... In PAGE 16: ... At the present time, none of the known attacks can obtain the re- sults we have presented in this paper: either building secret keys produc- ing keystream with given properties or retrieving secret keys from fixed keystream with desired properties. However, it is an open problem to deter- mine whether the attacks of Table4 can be modified or improved to obtain the results presented before. 6 Future Work and Conclusion In this paper, we have presented a scheme to prove the cryptanalysis of an encryption algorithm without disclosing any information on the nature of the cryptanalysis, while any verifier can check in a polynomial time the reality of that cryptanalysis.... ..."