(vi) Game [G.sub.5] : We embed the ECDH
problem into the simulation process: namely, An ECDH
instance means that given the two points a * P and b * P, we need to compute a * b * P without knowing the secret values a and b.
In the work  we showed our lightweight ECDH
implementation with various curves, where curves of the same size had up to 50 % speed difference.
is used to produce the secret key that will be used in AES to encrypt both tag's ID and the valuable data stored in the tag.
For any node i, which is initiating the communication (initiator), the generation of its ECDH
public key [k.sub.i] is done by selecting a random number and then encoding using the complex conversion routine encoding (CCRE).
TinyECC is a stable ECC implementation for constrained network entities, where in  the authors provide implementation details and measurement results for elliptic curve digital signature algorithm (ECDSA) and Diffie-Hellman key establishment (ECDH
For authentication, MU selects a random nonce [N'.sub.Mu] and a random number a, and computes aP value on E using ECDH
. MU then computes the following:
algorithm is used for authenticating broadcasts from HN-sensor.
For generating a shared secret key between A1 and B1 using ECDH
, both have to agree up on Elliptic Curve domain parameters.
Key Exchange: Elliptic Curve Diffie-Hellman (ECDH
) or Elliptic Curve Menezes-Qu-Vanstone (ECMQV) - Draft NIST Special Publication 800-56
Algorithm Modules size or size of n in bits RSA 2048, 4096 DSA 1024, 2048 ECDSA 192, 224, 256,384, 521 ECDH
192, 224, 256,384, 521 Table 6: SDN security solutions.
 Durlanik A, Sogukpinar I., "SIP authentication scheme using ECDH
[C]," in Proc.