RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2009 Number 4(6), Pages 64–71 (Mi pdm151)

Mathematical Methods of Cryptography

Argument of knowledge protocol for a Goppa codeword and for an error of a bounded weigth

V. E. Fedyukovych

Intropro, Kiev, Ukraine

Abstract: A new argument of knowledge protocol with honest verifier is proposed for the Goppa polynomial, codeword and the error of a bounded weight. The soundness of the protocol is based on the hardness assumption for the discrete logarithm problem.

Keywords: interactive argument system, zero knowledge, commitment scheme, Goppa code.

UDC: 519.725+519.816+519.712.6



© Steklov Math. Inst. of RAS, 2024