### Table 4: Rules for Diffie-Hellman key exchange

"... In PAGE 7: ... To improve read- ability, we will use ga and gab instead of g(a) and h(a, b). Table4 presents the rules specific to the way that Diffie- Hellman secrets are computed. DH1 captures the way that... ..."

### Table 3 Comparison of integer Diffie-Hellman and elliptic-curve Diffie-Hellman key exchanges

2002

"... In PAGE 5: ... Accordingly, a given level of security can be achieved with a k smaller than the number of bits required to encode the p in the integer Diffie-Hellman key exchange. Table3 provides a comparison of the basic features of 1024-bit integer Diffie-Hellman and 160-bit elliptic-curve Diffie-Hellman key exchanges. 6.... ..."

Cited by 4

### Table 1. Times for DIFFIE-HELLMAN KEY EXCHANGE Implementation

1998

"... In PAGE 20: ... In this implementation the private keys were chosen at random in the range h1; q degB 2 i, as was suggested in Section 3. Table1 gives the results of this implementation. The rst column gives the degree of B and the second column gives the degree of the eld extension.... ..."

Cited by 3

### Table 6. Rules for Diffie-Hellman key ex-

2003

"... In PAGE 13: ... To improve readability, we will use ga and gab in- stead of g(a) and h(a, b). Table6 presents the rules specific to the way that Diffie-Hellman secrets are computed. DH1 captures the way that a Diffie-Hellman secret is computed from an exponent and an exponential.... ..."

Cited by 26

### Table 1: Performance of the Diffie-Hellman key pair and the Diffie-Hellman shared key compu- tations (expressed in milliseconds)

2004

Cited by 1

### Table 7 Diffie-Hellman Axioms

"... In PAGE 15: ... To improve readability, we will use ga and gab instead of g(a) and h(a, b). Table7 presents the rules specific to the way that Diffie-Hellman secrets are computed. The predicate Computes() is used as a shorthand to denote the fact that the only way to compute a Diffie-Hellman secret is to possess one exponent and the other exponential.... ..."

### Table 2 shows the result of performing snmpget requests on the scalar sysDescr using different transports. There is a significant cost associated with the estab- lishment of SSH sessions. This is, however, not surprising since the SSH protocol establishes a session key using a Diffie-Hellman key exchange (using public-key cryptography) before the user authentication protocol is executed and the SSH channel is established. Since the cryptographic operations are CPU bound, the session establishment times increases significantly on our slow test machine.

2001

"... In PAGE 7: ... Table2 . Performance of snmpget requests (sysDescr.... In PAGE 7: ... Performance of snmpget requests (sysDescr.0) Table2 also shows that there is an clear difference in the amount of data (total size of the Ethernet frames) and the number of IP packets exchanged between UDP and TCP transports. While this overhead is usually not a big issue on a well functioning local area network, it might be an issue in networks... ..."

Cited by 1

### Table 1. Key Exchange Definitions. A The joining entity

"... In PAGE 4: ... Our algorithm uses the Diffie-Hellman Key Exchange [5]. Table1 defines the terminology that is used to describe the process of the key exchange algorithm. Table 2 presents the sequence of events.... ..."

### TABLE VII ENERGY CONSUMPTION OF MODULAR EXPONENTIATION, DETERMINED THROUGH INSTRUMENTATION OF AN IMPLEMENTATION OF DIFFIE-HELLMAN BASED ON DLP ON THE MICA2 WHICH COMPUTES 2x (MOD p), WHERE x IS A 160-BIT INTEGER AND p IS A 1,024-BIT PRIME.

### Table 1: Efficiency comparison for ElGamal variants in terms of ciphertext size, where |g|, |mac|, and |M| are sizes for a group element, an authentication tag, and a plaintext, respectively. For concreteness, one can think of |mac| = 128. DBDH and square-DBDH means the decisional bilinear Diffie-Hellman assumption [14] and the decisional square bilinear Diffie-Hellman assumption [32], respectively. ciphertext size assumption security bilinear group

2006

"... In PAGE 15: ... This method does not require any additional assumption. 5 Comparison Here, we discuss comparison among ElGamal variants in terms of ciphertext size, and it is summarized in Table1 . So far, under the DDH assumption the Kurosawa-Desmedt scheme [33] is considered as the most efficient scheme, and its ciphertext overhead is two group elements and an authentication tag.... ..."

Cited by 2