### Table 2 shows the results for one of these combinations, 255 and 256 period FSS keys using short-term security base scheme keys in their construction. Each key is used for its first 255 periods. As before, the other cases with different base key strengths and max- imum periods have similar results to those shown, but are omitted due to space constraints.

2003

"... In PAGE 8: ...0 15.2 Table2 : Forward-secure signature scheme performance (first 255 periods), in milliseconds. RSA-1536 DSA-1536 ECDSA-t233k1 1 10 100 1000 10000 Signatures per Key Generation 1 10 100 1000 10000 Verifications per Signature 1 10 100 1000 10000 100000 Cost (ms) (a) M3.... ..."

Cited by 10

### Table 2 shows the results for one of these combinations, 255 and 256 period FSS keys using short-term security base scheme keys in their construction. Each key is used for its first 255 periods. Other cases with different base key strengths and maximum periods have similar results, but are omitted due for brevity.

2003

"... In PAGE 8: ...0 15.2 Table2 : Forward-secure signature scheme performance (first 255 periods), in milliseconds. Other times, as is the case in Fig.... ..."

Cited by 10

### Table 2 shows the results for one of these combinations, 255 and 256 period FSS keys using short-term security base scheme keys in their construction. Each key is used for its first 255 periods. Other cases with different base key strengths and maximum periods have similar results, but are omitted due for brevity.

2003

"... In PAGE 8: ...0 15.2 Table2 : Forward-secure signature scheme performance (first 255 periods), in milliseconds. below in Fig.... ..."

Cited by 10

### Table 2: Forward-secure signature scheme performance (first 255 periods), in milliseconds.

2003

"... In PAGE 9: ... Later in this section we will explore the impact of relaxing this assumption. Table2 shows the results for one of these combinations, 255 and 256 period FSS keys using short-term security base scheme keys in their construction. Each key is used for its first 255 periods.... ..."

Cited by 10

### Table 2: Forward-secure signature scheme performance (first 255 periods), in milliseconds.

2003

"... In PAGE 8: ... Later in this section we will explore the impact of relaxing this assumption. Table2 shows the results for one of these combinations, 255 and 256 period FSS keys using short-term security base scheme keys in their construction. Each key is used for its first 255 periods.... ..."

Cited by 10

### Table 2: Forward-secure signature scheme performance (first 255 periods), in milliseconds.

2003

"... In PAGE 8: ... Later in this section we will explore the impact of relaxing this assumption. Table2 shows the results for one of these combinations, 255 and 256 period FSS keys using short-term security base scheme keys in their construction. Each key is used for its first 255 periods.... ..."

Cited by 10

### Table 3 Overall Rankings and Order

2002

"... In PAGE 3: ... Although a detailed discussion for using the additive model is beyond the scope of this paper, the additive model allows one to rank each technology (Security) based on its normalized rank v(Securityf) weighted wf by each factor f. Table3 shows the results of each technology and its order. ... ..."

Cited by 2

### Table 1. Comparison of the Multiset Hash Functions

2003

"... In PAGE 11: ...Conclusion We have introduced incremental multiset hash functions which can be efficiently updated, and for which the ordering of inputs is not important. Table1 sum- marizes our comparison of the multiset hash functions introduced in this paper. In the table, we indicate whether the security is based on pseudorandom family of hash functions (PRF), the random oracle model (RO), the discrete log as- sumption (DL), or/and the hardness of the worst case shortest vector problem (SV).... ..."

Cited by 18

### Table 2: NIST recommended primes [5].

"... In PAGE 8: ...epresentation...........................................................................................................12 Table2 : NIST recommended primes [5].... In PAGE 34: ... This thesis focuses on prime fields. Table2 lists the various primes recommended by NIST to guard against selecting cryptographically insecure primes in ECC implementations. It also lists the key sizes in RSA that give equivalent security based on the time to attack both algorithm [17].... ..."

### Table 1. Script identification results Script

"... In PAGE 3: ...y the scripts apos; sample sizes.Results. The linear discriminant analy- sis was 88% accurate. Table1 breaks down these results by script, and also presents the cross-classification matrix. The individual percentages for the different scripts were pleasingly uniform, especially since the amount and quality of data available for the different scripts varied considerably.... ..."