On the Design of Code-Based Signatures

Ayoub Otmani (1, 2)

1 Equipe AMACC - Laboratoire GREYC - UMR6072
2 SECRET - Security, Cryptology and Transmissions

One important and challenging issue in modern cryptography is to propose an efficient digital signature scheme based on intractability assumptions from coding theory. This is in contrast to what occurs on the encryption side where immediately after Diffie and Hellman's suggestion to base cryptographic primitives on one-way functions, McEliece proposed an encryption scheme using linear codes. The difficulty in the design of code-based signatures mainly rests on the problem of discovering a family of codes for which one is able to find in polynomial-time the closest vector in the code for any message. This talk will give a survey of the existing signature schemes, discuss their security, efficiency, and will conclude with future directions towards the design of an efficient scheme. This is a joint work with Jean-Pierre Tillich.

Mots clés: signature; code-based cryptography; rate-distortion theory; polar codes

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Ayoub Otmani. On the Design of Code-Based Signatures. Code-based Cryptography Workshop - CBC 2012, May 2012, Lyngby, Denmark. ⟨hal-00921494⟩