Signatures for network coding (Q622765)

The paper presents a new digital signature scheme with practical application to network coding. The authors present their idea based on elliptic curves and proof its security to hash collisions. They also prove that forging a signature in proposed signing is as hard as computing discrete logs. Finally it is described the setup of the scheme in detailed steps. It is shown how could be found a suitable elliptic curve and the p-torsion points. A detailed example from algebra package \texttt{MAGMA} is attached. I recommend the paper both to theoretical researchers and to practitioners in the mentioned scientific areas.