### Table 3. Specification of Diffie-Hellman Protocol

### 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 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 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 1: Performance of the Diffie-Hellman key pair and the Diffie-Hellman shared key compu- tations (expressed in milliseconds)

2004

Cited by 1

### 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: Comparison of present work to previous blind signatures

2005

"... In PAGE 4: ... Note that the resulting signature from the signing protocol is about half the size of an RSA based Chaum blind signature. Table1 compares the round complexity of our construction in comparison to previous blind signature schemes. The construction is proven to satisfy the two properties of [JLO97] model as follows: the blindness property is ensured under the Decisional Composite Residuosity assumption of [Pai99] and the Decision Linear Diffie-Hellman assumption of [BBS04].... ..."

Cited by 3