The generation of a shared secret key K in theimplementation of a key agreement protocol, for example MQV, may be optimizedforaccelerated computation by selecting the ephemeral public key and thelong-term public key of a correspondent to be identical. One correspondentdetermines whether the pair of public keys of the other correspondent areidentical. If it is, a simplified representation of the shared key K is usedwhich reduces the number of scalar multiplication operations for anadditive group or exponentiation operations for a multiplicative group.Furtheroptimisation may be obtained by performing simultaneous scalarmultiplication or simultaneous exponentiation in the computation of K.
展开▼
