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



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






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


Diskretnaya Matematika, 2004, Volume 16, Issue 2, Pages 79–84
DOI: https://doi.org/10.4213/dm153
(Mi dm153)
 

This article is cited in 5 scientific papers (total in 5 papers)

On the McEliece public-key cryptosystem based on Reed-Muller binary codes

G. A. Karpunin
Full-text PDF (606 kB) Citations (5)
References:
Abstract: We study the McEliece cryptosystem with $u$-fold use of binary Reed–Muller codes $\mathit{RM}(r,m)$. This modification of the McEliece cryptosystem was proposed by V. M. Sidelnikov in 1994 and combines high cryptographic security, transmission rate close to one, and moderate complexity of both enciphering and deciphering. For arbitrary values of the parameters $u$, $r$, and $m$ we give an upper bound for the cardinality of the set of public keys of this cryptosystem and calculate its exact value in the case of $u=2$ and $r=1$.
Received: 16.07.2002
English version:
Discrete Mathematics and Applications, 2004, Volume 14, Issue 3, Pages 257–262
DOI: https://doi.org/10.1515/1569392031905601
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: G. A. Karpunin, “On the McEliece public-key cryptosystem based on Reed-Muller binary codes”, Diskr. Mat., 16:2 (2004), 79–84; Discrete Math. Appl., 14:3 (2004), 257–262
Citation in format AMSBIB
\Bibitem{Kar04}
\by G.~A.~Karpunin
\paper On the McEliece public-key cryptosystem based on Reed-Muller binary codes
\jour Diskr. Mat.
\yr 2004
\vol 16
\issue 2
\pages 79--84
\mathnet{http://mi.mathnet.ru/dm153}
\crossref{https://doi.org/10.4213/dm153}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2084570}
\zmath{https://zbmath.org/?q=an:1121.94019}
\transl
\jour Discrete Math. Appl.
\yr 2004
\vol 14
\issue 3
\pages 257--262
\crossref{https://doi.org/10.1515/1569392031905601}
Linking options:
  • https://www.mathnet.ru/eng/dm153
  • https://doi.org/10.4213/dm153
  • https://www.mathnet.ru/eng/dm/v16/i2/p79
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024