### Table 3: Proposed Schemes for One-Way functions

2004

"... In PAGE 10: ... In this case, we do not need a trapdoor but merely the intractability of the C5C9-problem. Hence, we suggest to generate random C5C9-polynomials with the parameters as suggested in Table3 . As Table 3: Proposed Schemes for One-Way functions... ..."

### Table 3: Proposed Schemes for One-Way functions

"... In PAGE 11: ... In this case, we do not need a trapdoor but merely the intractability of the MQ-problem. Hence, we suggest to generate random MQ-polynomials with the parameters as suggested in Table3 . As Table 3: Proposed Schemes for One-Way functions... ..."

### Table 3: Proposed Schemes for One-Way functions

"... In PAGE 11: ... In this case, we do not need a trapdoor but merely the intractability of the MQ-problem. Hence, we suggest to generate random MQ-polynomials with the parameters as suggested in Table3 . As Table 3: Proposed Schemes for One-Way functions... ..."

### Table 3: Proposed Schemes for One-Way functions

"... In PAGE 31: ... In this case, we do not need a trapdoor but merely the intractability of the MQ-problem. Hence, we suggest to generate random MQ-polynomials with the parameters as suggested in Table3 . As for Table 1, the evaluation timings are based on [CGP02].... ..."

### Table 1: Characterizations of the existence of various types of one-way functions: the partial func- tion case.

1999

### Table 6.1: Two Practical One-Way Hash Functions Hashing Hashing

### Table 5. Disadvantages of Algorithm and Key-based Schemes Algorithm-based Key-based When all the one way functions on the smart card are consumed because of piracy, a smart card change is essential.

2005

"... In PAGE 8: ...able 4. Advantages of Algorithm and Key-based Schemes........................................... 28 Table5 .... ..."

### Table 1: A summary of the bounds one-way two-way

1993

"... In PAGE 3: ... The proofs of the bounds use either combinatorial arguments (counting the number of vectors of a particular type), or simulations (of a randomized protocol by a deterministic one). Table1 contains the bounds for the four mod-... In PAGE 6: ... Part (b) follows. 2 4 Protocols We demonstrate the tightness of our lower bounds (summarized in Table1 ) by showing protocols for non-degenerate functions. We do this separately for the one-way and the two-way cases.... ..."

Cited by 13

### Table 1 One-way analysis of variance for counts. Transaction initiation process for day 2. ~

"... In PAGE 4: ...f 19.4878. The F-ratio, for- mally given by F = amp;:/ k, Figure 2 Estimated mean number of transactions initiated in has an F-distribution with apos;1 = (rn - apos;1 x = 39 x 12, averaging counts in 4800 adjacent unit time intervals. This very in Table1 is highly significant at a 5 percent level or at a a unit time interval for days 1, 2, and 3. Estimates obtained by u2= k- 1 = 11 degrees of freedom, and the value 19.... In PAGE 4: ... The square root of a Poisson variate N plus a fourth, m, has mean approximately equal to *, and variance a, where p is the Poisson mean The analysis of selected time periods reported below is for periods chosen from day 2. In Table1 we show in successive columns the number of counts (transaction initiations) in successive groups of forty 120-time-unit periods; the mean number of counts in one time unit (the rate function estimate plotted in Fig. 2) for day 2; Xi the average of forty quantities xij where xij = {(number of counts in jth 120-time-unit period in group i) + a};; 6: and ei, the within group sample variance and standard deviation, respectively.... ..."

### Table 1. Cost model in cycle for one-way comb implementation in the case of else if and switch structures. MpD depends on the decision tree structure, furthermore it is not a fixed constant for each cost function.

2004

"... In PAGE 6: ... An extra one cycle overhead is needed to pipeline predicate computations (comparisons) ahead of their qualified branches. The cycle costs for a one-way comb implementation, for the last leaf (worst latency) and for the median one are displayed in Table1 . The last leaf corresponds to the case where the targeted leaf is the last one in the comb therefore yielding to the maximum number of branch predictions for this decision tree.... In PAGE 7: ...difference is the number of integer comparisons per node, reduced to one. The cycle costs for a one-way comb implementation, are given in Table1 . Every cycle, only two... ..."

Cited by 1