\begin{abstract}
This paper describes a way to compare 2 different cryptographic backends for the cMix mix network. It tries to focus on making a fair comparison between the two and focuses mainly on the latency aspect of the cMix primitives. It concludes that although it still has some implementation specific problems the elliptic curve backend for cMix seems to be a faster alternative to the more conservative multiplicative group algorithm.
\end{abstract}