Improved Identification Schemes Based on Error-Correcting Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Applicable Algebra in Engineering, Communication and Computing Year : 1997

Improved Identification Schemes Based on Error-Correcting Codes

Abstract

As it is often the case in public-key cryptography, the first practical identification schemes were based on hard problems from number theory (factoring, discrete logarithms). The security of the proposed scheme depends on an NP- complete problem from the theory of error correcting codes: the syndrome decoding problem which relies on the hardness of decoding a binary word of given weight and given syndrome. Starting from Stern's scheme [18], we define a dual version which, unlike the other schemes based on the SD problem, uses a generator matrix of a random linear binary code. This allows, among other things, an improvement of the transmission rate with regards to the other schemes. Finally, by using techniques of computation in a finite field, we show how it is possible to considerably reduce: -- the complexity of the computations done by the prover (which is usually a portable device with a limited computing power), -- the size of the data stored by the latter.
Fichier principal
Vignette du fichier
gsdscheme.pdf (1.18 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00680477 , version 1 (20-03-2012)

Identifiers

Cite

Pascal Véron. Improved Identification Schemes Based on Error-Correcting Codes. Applicable Algebra in Engineering, Communication and Computing, 1997, 8 (1), ⟨10.1007/s002000050053⟩. ⟨hal-00680477⟩

Collections

UNIV-TLN IMATH
96 View
586 Download

Altmetric

Share

Gmail Facebook X LinkedIn More