### Table 2. Comparison of hardware resources

"... In PAGE 10: ...olynomial bases. The delay seems to be constant and independent to n. However, a fanout equal to n is required which increases the critical path delay and/or the area. Table2 compares the hardware resources required for sequential multiplication using Dickson bases and polynomial bases im- plemented over F2n. The current values in Table 2 are for an arbitrary r.... In PAGE 10: ... Table 2 compares the hardware resources required for sequential multiplication using Dickson bases and polynomial bases im- plemented over F2n. The current values in Table2 are for an arbitrary r. When r is fixed, some of these would be reduced.... ..."

### Table 11: Technical Specifications of the Onyx2 Graphics Hardware Family

"... In PAGE 20: ... Depending on the quality of the scan-conversion results, the state of art graphics hardware using antialiasing is 60-120 times slower than that not using antialiasing capability. Table11 is a quote of technical specifications of the new Onyx2 graphics hardware scan- converting pixels with and without antialiasing[32]. Table 10 - The last column reads as follows: Onyx2 RealityMonster can fill (scan-convert, or drawing into framebuffer) pixels at the speed of 5.... ..."

### Table. 3. Hardware counters to collect statistics efficiently.

2004

Cited by 10

### Table 1: Timings for polynomial multiplication over Fp

"... In PAGE 4: ... We implemented an in-place algorithm for classical polynomial multiplication [37] in both C and Java. Table1 re ects the results of multiplying polynomials of degree n = 10000 to n = 50000. All times are in CPU... ..."

### Table 1: Timings for polynomial multiplication over Fp

"... In PAGE 4: ... We implemented an in-place algorithm for classical polynomial multiplication [37] in both C and Java. Table1 re ects the results of multiplying polynomials of degree n = 10000 to n = 50000. All times are in CPU... ..."

### Table 1: Timings for polynomial multiplication over Fp

"... In PAGE 4: ... We implemented an in-place algorithm for classical polynomial multiplication [37] in both C and Java. Table1 re ects the results of multiplying polynomials of degree n = 10000 to n = 50000. All times are in CPU seconds.... ..."

### Table 1: Timings for polynomial multiplication over Fp

"... In PAGE 4: ... We implemented an in-place algorithm for classical polynomial multiplication [36] in both C and Java. Table1 re ects the results of multiplying polynomials of degree n = 10000 to n = 50000. All times are in CPU... ..."