### Table 2. Cost of the various algorithms for a product of n pairings, d = 2 Security level Algorithm Cost for n pairings Cost per extra pairing k = 6 Weil 17256 n+ 8208 0.678

### Table 3. Cost of the various algorithms for a product of n pairings, d = 6 Security level Algorithm Cost for n pairings Cost per extra pairing k = 6 Weil 10012 n+ 7782 0.563

### Table 1: Number of computations to be performed by each user in each tripartite protocol.

2003

"... In PAGE 10: ... 8. Protocol Properties Table1 gives a comprehensive idea about the number of computations per user in each of the above protocols. The basic computations being Elliptic curve Scalar Multiplications, Addition of points on the Elliptic curve, and the evaluation of Weil pairings.... ..."

Cited by 13

### Table 1: Number of computations to be performed by each user in each tripartite protocol.

2003

"... In PAGE 10: ... 8. Protocol Properties Table1 gives a comprehensive idea about the number of computations per user in each of the above protocols. The basic computations being Elliptic curve Scalar Multiplications, Addition of points on the Elliptic curve, and the evaluation of Weil pairings.... ..."

Cited by 13

### Table 4 Execution Times (in msec) in ID-based Encryption Schemes for the NIST Curves

"... In PAGE 17: ... The size of message encrypted in our implementation is 160 ASCII characters. Table4 lists the execution times in the ID-based encryption scheme using double-and-add method and halve-and-add method, and shows the improvements. The Weil pairing is the primitive operation for both encryption and decryption in the ID-based encryption scheme.... ..."

### Table 9. Ranks and bases of Mordell-Weil groups

1999

Cited by 7

### Table 18. Rank and basis of Mordell-Weil group

1999

Cited by 7