|
Prikladnaya Diskretnaya Matematika, 2009, supplement № 1, Pages 30–32
(Mi pdm118)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical Methods of Cryptography, Steganography and Coding
Argument of knowledge of a Goppa codeword and of a bounded error
V. E. Fedyukovich
Abstract:
A new protocol is introduced to show knowledge of a Goppa polynomial and of a codeword, as well as that error is of a bounded weight. The protocol is a special honest verifier zero knowledge proof under assumption of the discrete logarithm problem hardness.
Citation:
V. E. Fedyukovich, “Argument of knowledge of a Goppa codeword and of a bounded error”, Prikl. Diskr. Mat., 2009, supplement № 1, 30–32
Linking options:
https://www.mathnet.ru/eng/pdm118 https://www.mathnet.ru/eng/pdm/y2009/i10/p30
|
Statistics & downloads: |
Abstract page: | 124 | Full-text PDF : | 42 |
|