Improved identification schemes based on error-correcting codes

  • Pascal Véron
  • Published 1996 in
    Applicable Algebra in Engineering, Communication…


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… (More)
DOI: 10.1007/s002000050053


2 Figures and Tables