In this article, we propose a protocol to generate n
2
keys
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.
Relation:
The 4th International Conference on Advanced Communication and Networking
