Geodesic
Argument of knowledge of a~Goppa codeword and of a~bounded error
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 30-32.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{PDM_2009_10_a14,
     author = {V. E. Fedyukovich},
     title = {Argument of knowledge of {a~Goppa} codeword and of a~bounded error},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {30--32},
     publisher = {mathdoc},
     number = {10},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a14/}
}
TY  - JOUR
AU  - V. E. Fedyukovich
TI  - Argument of knowledge of a~Goppa codeword and of a~bounded error
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 30
EP  - 32
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_10_a14/
LA  - ru
ID  - PDM_2009_10_a14
ER  - 
%0 Journal Article
%A V. E. Fedyukovich
%T Argument of knowledge of a~Goppa codeword and of a~bounded error
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 30-32
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_10_a14/
%G ru
%F PDM_2009_10_a14
V. E. Fedyukovich. Argument of knowledge of a~Goppa codeword and of a~bounded error. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 30-32. http://geodesic.mathdoc.fr/item/PDM_2009_10_a14/