The Performance of Elliptic Curve Based Group Diffie-Hellman Protocols for Secure Group Communication over Ad Hoc Networks

The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in overall performance for secure group communication among the four schemes discussed in the paper. Low communication overhead, relatively low computation load and short packets are the main reasons for the good performance of the TGECDH protocol.

Comparison of Two Roadside Survey Procedures for Dwarf Mistletoes on the Sawtooth National Forest, Idaho

Two roadside surveys were conducted for dwarf mistletoes parasitizing lodgepole pine and Douglas-fir on the Sawtooth National Forest, Idaho. One survey used variable-radius plots located less than 150 m from roads. The 2nd survey used variable-radius plots established at 200-m intervals along 1600-m transects run perpendicular to the same roads. Estimates of the incidence (percentage of trees infected and percentage of plots infested) and severity (average dwarf mistletoe rating) for both lodgepole pine and Douglas-fir dwarf mistletoes were not significantly different for the 2 survey methods. These findings are further evidence that roadside-plot surveys and transect-plot surveys conducted away from roads provide similar estimates of the incidence of dwarf mistletoes for large forested areas.