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, 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
References:
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.
Document Type: Article
UDC: 519.725+519.816+519.712.6
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Fed09}
\by V.~E.~Fedyukovych
\paper Argument of knowledge protocol for a~Goppa codeword and for an error of a~bounded weigth
\jour Prikl. Diskr. Mat.
\yr 2009
\issue 4(6)
\pages 64--71
\mathnet{http://mi.mathnet.ru/pdm151}
Linking options:
  • https://www.mathnet.ru/eng/pdm151
  • https://www.mathnet.ru/eng/pdm/y2009/i4/p64
    Cycle of papers
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:455
    Full-text PDF :103
    References:46
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024