### Table 1. Scalar Multiplication Speed

"... In PAGE 2: ... For example, in [2] it is about ten times as fast as characteristic two finite fields. Table1 [2] shows the results of an elliptic curve implementation over OEF. 4 Security Considerations There are no general security considerations for the OEF representation; This is merely alternate definition fields.... ..."

### Table 1. Simultaneous, multiple actuator

"... In PAGE 4: ... When multiple actuators are poked at the same time, the resulting mirror de#0Dection does not equal the sum of the individual pokes. Table1 and #0Cgure 6 demonstrate this nonlinearity. The major di#0Berence between the interferogram pairs shown in the #0Cgure is not in the shape, but in the magnitude of the de#0Dection.... ..."

### Table 3. Timings of scalar multiplication

2005

"... In PAGE 11: ... We have measured the average timings of the scalar multiplication for the Harley algo- rithm (Harley), the Harley algorithm with one exceptional procedure (Harley + ExHarley), and the Harley algorithm with one exceptional procedure of the Cantor algorithm (Harley + ExCantor). Table3 shows the results with 50000 random samples. The arithmetic of HECC was programmed only using the operations of finite field F283.... ..."

Cited by 3

### Table 3. Timings of scalar multiplication

2005

"... In PAGE 11: ... We have measured the average timings of the scalar multiplication for the Harley algo- rithm (Harley), the Harley algorithm with one exceptional procedure (Harley + ExHarley), and the Harley algorithm with one exceptional procedure of the Cantor algorithm (Harley + ExCantor). Table3 shows the results with 50000 random samples. The arithmetic of HECC was programmed only using the operations of finite field F283.... ..."

Cited by 3

### Table 5. Multiple simultaneous parameter estimation

2002

### Table 1: Comparison of the scalar point multiplication imple-

"... In PAGE 3: ... The operations on the low- est abstraction level were realized using Assembler, while those on higher levels were written in NesC. Table1 compares the performance of the point multiplication with existing solutions, namely TinyECC-0.2 [10] and the solution from [9] and [18].... In PAGE 3: ...2 [10] and the solution from [9] and [18]. Note that in Table1 the results in the first row im- ply that the point multiplication employed in the ECElGamal was realized by using only the Left-to-Right binary method. The val- ues in the second row of the table present the point multiplication accelerated by using 2MOF.... In PAGE 4: ...532ms is the execution time of one modular multiplica- tion, see [17]. For a fair comparison, this value is already added to the results in Table1 . Finally, Table 2 shows the performance of the different realizations of the EC-ElGamal, which contains two point multiplications with n-bit scalar k and one short point mul- tiplication with the sensed data m, see Algorithm 1.... ..."

Cited by 1

### Table 1. Comparison of Elliptic Scalar Multiplication Techniques.

1999

"... In PAGE 41: ... 3 requires m=3 additions and no dou- bles. This is at least 50% faster than any of the earlier versions, as shown in Table1 . The \length quot; and \density quot; columns in Table... ..."

Cited by 7

### Table 2. Improved timing of scalar multiplication

2005

"... In PAGE 9: ...In order to demonstrate the improvement of our algorithm, we implemented the proposed scheme (See Table2 ). For our experiment we chose the following hyperelliptic curve with genus 2 from [HSS00]: Let F283 be defined as F2[t]/(t83 + t7 + t4 + t2 + 1) and y2 + h(x)y = f(x) over F283, h(x) = x2 + 2b770d0d26724d479105fx + 540efb4e1010a0fc69f23, f(x) = x5 + 2cc2f2131681e8fe80246x3 + 53b00bad6fbb8f6ea5538x + 54f5f3b4f4fc25898ee4.... ..."

Cited by 3