On Efficient Key Agreement Protocols.
Anish Mathuria, Vipul Jain · 2005
A class of effcient key agreement protocols proposed by Boyd is examined. An attack is demonstrated on a round-optimal example protocol of this class, and a simple countermeasure is suggested. The whole class is known to be vulnerable to an attack proposed by Bauer, Berson and Feiertag. A new class of key agreement protocols without this vulnerability but having the same advantages in effciency is identified, and a number of concrete protocols are proposed.