Implementation of a provably
secure MQ based signature
scheme (C/C++/Java)
Crypto Lab (SS2012)
At CRYPTO 2011 Sakumoto et al. presented a new identification scheme, whose security is
based solely on the MQ-Problem of solving systems of nonlinear equations over a finite field.
Via the Fiat-Shamir paradigm this scheme can be extended to a provable secure signature
scheme.
The goal of this project is to implement this MQ-based signature scheme in C/C++
and/or Java. After having created a basic version of the scheme, it can be extended to a
(threshold) ring signature scheme.
The operations which have to be performed are basically evaluations of polynomials with the
finite field arithmetic (especially GF(2m)).
Required Skills:
 Basic knowledge about cryptography (identification and signature schemes)
 Programming skills in C/C++/Java
Contact: Albrecht Petzoldt, S2/02, B206
apetzoldt@cdc.informatik.tu-darmstadt.de