Signatures with chained linear-codes

In this paper, we will introduce a new digital signature scheme based on the well-known problem: Syndrome Decoding (SD). This scheme has better performances to our scheme introduced in "O.Hamdi, A.Bouallegue, S.Harari, Signature with chained BCH-codes". It consists in chaining a set of linear-codes. Our scheme generates a short and fast signature. In addition to that, it has a smaller public key size than the McEliece signature introduced by N.Courtois, M.Finiasz and N.Sendrier. The obtained results show the efficiency of our scheme in public key size and in signature length.