摘要:In this paper, we propose a protocol to generate n2keys in one session under the assumption of the intractability of the elliptic curve discrete logarithm problem and MQV protocol. Our protocol has the advantage of requiring less computing time compared with other protocols. Therefore, it is easy to apply in resource-constrained key agreement such as wireless sensor networks, mobile Ad-hoc networks, and cell phones which are severely constrained processor, battery, and memory.