这是一份nottingham诺丁汉大学COMP3077作业代写的成功案例

$$
\begin{array}{ccc}
\text { Alice } & & \text { Bob } \
a & \stackrel{[a] G}{\longrightarrow} & {[a] G} \
{[b] G} & \stackrel{[b] G}{\longleftrightarrow} & b
\end{array}
$$
Alice can now compute
$$
K_{A}=[a]([b] G)=[a b] G
$$
and Bob can now compute
$$
K_{B}=[b]([a] G)=[a b] G .
$$

COMP3077 COURSE NOTES ：

INPUT: Message $m$ and public key $Y$.
OUTPUT: The ciphertext $(U, c, r)$.

1. Choose $k \in_{R}{1, \ldots, q-1}$.
2. $U \leftarrow[k] G$.
3. $T \leftarrow[k] Y$.
4. $\left(k_{1} | k_{2}\right) \leftarrow K D(T, l)$.
5. Encrypt the message, $c \leftarrow E_{k_{1}}(m)$.
6. Compute the MAC on the ciphertext, $r \leftarrow M A C_{k_{2}}(c)$.
7. Dutput $(U, c, r)$.