### Table 1. McEliece and Niederreiter code-based cryptosystems

2001

"... In PAGE 3: ...i.e. minimum distance is at least 2t + 1). Let G and H denote respectively a generator and a parity check matrix of C. Table1 brie y describes the two main encryption schemes based on code. In both case the trap is a t-error correct-... ..."

Cited by 19

### Table 4. Summary of results for the split-connection schemes at an average error rate of 1 every 64 KB.

1997

"... In PAGE 11: ... The TCP sender of the second, wireless connection performs all the retransmissions in response to wireless losses. Figure 9 and Table4 show the throughput and goodput for the split connection approach in the LAN and WAN envi- ronments. We report the results for two cases: when the wireless connection uses TCP Reno (labeled SPLIT) and when it uses the SMART-based selective acknowledgment scheme described earlier (labeled SPLIT-SMART).... ..."

Cited by 640

### Table 4. Summary of results for the split-connection schemes at an average error rate of 1 every 64 KB.

1997

"... In PAGE 11: ... The TCP sender of the second, wireless connection performs all the retransmissions in response to wireless losses. Figure 9 and Table4 show the throughput and goodput for the split connection approach in the LAN and WAN envi- ronments. We report the results for two cases: when the wireless connection uses TCP Reno (labeled SPLIT) and when it uses the SMART-based selective acknowledgment scheme described earlier (labeled SPLIT-SMART).... ..."

Cited by 640

### Table 1. McEliece and Niederreiter code-based cryptosystems

"... In PAGE 3: ...i.e. minimum distance is at least 2t + 1). Let G and H denote respectively a generator and a parity check matrix of C. Table1 brie y describes the two main encryption schemes based on code. In both case the trap is a t-error correct-... ..."

### Table 1: A brief survey of the chaotic image encryption literature Scheme Strengths Weakness and known at- tacks

2008

"... In PAGE 3: ... The first approach has been widely used to design chaotic stream ciphers, while the second is specially employed by chaos-based block encryption schemes. (Refer Table1 for a brief overview on some recent chaos-based image encryption schemes and their properties). The rest of the paper is organized as follows: The next section gives a brief description of the original line map algorithm and its use in encrypting and decrypting images as developed in [2].... ..."

### Table 1 : Comparison of computations in signature-then-encryption, ID-based signcryption by Malone-Lee, and the new signcryption scheme

2003

Cited by 9

### Table 1 : Comparison of computations in signature-then-encryption, ID-based signcryption by Malone-Lee, and the new signcryption scheme

2003

Cited by 9

### Table 2 Computational complexity in homomorphic encryption Volume One bidder

"... In PAGE 3: ... Therefore, the computation and communication complexity of e-auction based on homomorphic encryption are increased in opening stage. Table2 shows the computational complexity of [CLK03] scheme based on homomorphic encryption. Table 2 Computational complexity in homomorphic encryption Volume One bidder ... ..."