Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
Full-text PDF (413 kB) Citations (1)
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.
Document Type: Article
UDC: 519.725+519.816+519.712.6
Language: Russian
Citation: V. E. Fedyukovich, “Argument of knowledge of a Goppa codeword and of a bounded error”, Prikl. Diskr. Mat., 2009, supplement № 1, 30–32
Citation in format AMSBIB
\Bibitem{Fed09}
\by V.~E.~Fedyukovich
\paper Argument of knowledge of a~Goppa codeword and of a~bounded error
\jour Prikl. Diskr. Mat.
\yr 2009
\pages 30--32
\issueinfo supplement № 1
\mathnet{http://mi.mathnet.ru/pdm118}
Linking options:
  • https://www.mathnet.ru/eng/pdm118
  • https://www.mathnet.ru/eng/pdm/y2009/i10/p30
    Cycle of papers
    This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:124
    Full-text PDF :42
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024