|
Prikladnaya Diskretnaya Matematika, 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.
Citation:
V. E. Fedyukovych, “Argument of knowledge protocol for a Goppa codeword and for an error of a bounded weigth”, Prikl. Diskr. Mat., 2009, no. 4(6), 64–71
Linking options:
https://www.mathnet.ru/eng/pdm151 https://www.mathnet.ru/eng/pdm/y2009/i4/p64
|
Statistics & downloads: |
Abstract page: | 473 | Full-text PDF : | 110 | References: | 55 | First page: | 1 |
|