### Table 2. The number of new modular hyperelliptic curves of genus g.

"... In PAGE 35: ....5. Computational results. Table2 summarizes the results of the computations. Each entry indicates the number of new modular hyperelliptic curves over Q with the genus prescribed by the column, and with jacobian satisfying the conditions prescribed by the row heading.... In PAGE 35: ...resp. 2000, resp. 569). This leads us to believe that the lower bounds in Table2 are close to the exact numbers. Finally, we note that all levels obtained when g gt; 2 have at most two different odd prime... ..."

Cited by 3

### Table 2. The number of new modular hyperelliptic curves of genus g.

"... In PAGE 36: ....5. Computational results. Table2 summarizes the results of the computations. Each entry indicates the number of new modular hyperelliptic curves over Q with the genus prescribed by the column, and with jacobian satisfying the conditions prescribed by the row heading.... In PAGE 36: ...resp. 2000, resp. 569). This leads us to believe that the lower bounds in Table2 are close to the exact numbers. Finally, we note that all levels obtained when g gt; 2 have at most two different odd prime divisors and only the levels N = 36, 72, 144, 784 are divisible by the square of an odd prime.... ..."

Cited by 3

### Table 1. Speeding up group operations on hyperelliptic curves of genus two.

2003

"... In PAGE 3: ... There was also some effort to find explicit formulae to perform the group operation for HECC without using inversions for genus-2 curves [Lan02b,Lan02c]. Table1 summarizes the efforts made to date to speed up genus-2 curves. In Table 1, I refers to inversion, M to multiplication, S to squaring, and M=S to multiplications or squarings, since squarings are assumed to be of the same complexity as a multiplication in these publications.... ..."

Cited by 35

### Table 1. Speeding up group operations on hyperelliptic curves of genus two.

"... In PAGE 3: ... There was also some effort to find explicit formulae to perform the group operation for HECC without using inversions for genus-2 curves [Lan02b,Lan02c]. Table1 summarizes the efforts made to date to speed up genus-2 curves. In Table 1, I refers to inversion, M to multiplication, S to squaring, and M/S to multiplications or squarings, since squarings are assumed to be of the same complexity as a multiplication in these publications.... ..."

### Table 1. Test-outputs of the VMPC Cryptosystem

"... In PAGE 9: ...VMPC Cryptosystem test vectors Table1 gives 16 test output-bytes generated by the VMPC Cryptosystem for a given 16-byte key K and a given 16-byte nonce N: Table 1. Test-outputs of the VMPC Cryptosystem... ..."

### Table 1. Test-outputs of the VMPC Cryptosystem

"... In PAGE 9: ...VMPC Cryptosystem test vectors Table1 gives 16 test output-bytes generated by the VMPC Cryptosystem for a given 16-byte key K and a given 16-byte nonce N: Table 1. Test-outputs of the VMPC Cryptosystem... ..."

### Table 1. Test-outputs of the VMPC Cryptosystem

"... In PAGE 9: ...VMPC Cryptosystem test vectors Table1 gives 16 test output-bytes generated by the VMPC Cryptosystem for a given 16-byte key K and a given 16-byte nonce N: Table 1. Test-outputs of the VMPC Cryptosystem... ..."

### Table 2. Measurements of Computation Delay in RSA cryptosystem

2002

"... In PAGE 9: ...We use RSA cryptographic primitives to realize the public key cryptosystem in our design. The result shown in Table2 illustrates the performance of RSA cryptosystem are not prohibitively expensive even for the low-end device. Thus leveraging PKI-based ap- proaches into wireless ad-hoc networks is an accept- able solution.... ..."

Cited by 27

### Table 4. Performance Comparison of Additive Homomorphic Cryptosystems

2006

"... In PAGE 11: ...Table 4. Performance Comparison of Additive Homomorphic Cryptosystems Table4 shows the comparison of the three homomorphic cryptosystems. The size of ciphertexts reflects both the overhead of storage at the server and transmission of aggregate values.... In PAGE 12: ... The size of these tables directly affect the efficiency of the search in that the larger the tables the faster the search. When deriving the results in Table4 , we assumed aggregation of 10,000 20-bit bit values (e.g.... ..."

Cited by 4

### Table 2. Measurements of Computation Delay in RSA cryptosystem

2002

"... In PAGE 9: ...We use RSA cryptographic primitives to realize the public key cryptosystem in our design. The result shown in Table2 illustrates the performance of RSA cryptosys- tem are not prohibitively expensive even for the low- end device. Thus leveraging PKI-based approaches into wireless ad-hoc networks is an acceptable solution.... ..."

Cited by 27