RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



J. Comp. Eng. Math.:
Year:
Volume:
Issue:
Page:
Find






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


J. Comp. Eng. Math., 2018, Volume 5, Issue 2, Pages 16–33 (Mi jcem116)  

Computational Mathematics

On the Berger–Loidreau cryptosystem on the tensor product of codes

V. M. Deundyakab, Yu. V. Kosolapova

a Southern Federal University (Rostov-on-Don, Russian Federation)
b FGNU NII "Specvuzavtomatika" (Rostov-on-Don, Russian Federation)

Abstract: In the post-quantum era, asymmetric cryptosystems based on linear codes (code cryptosystems) are considered as an alternative to modern asymmetric cryptosystems. However, the research of the strength of code McEliece-type cryptosystems shows that algebraically structured codes do not provide sufficient strength of these cryptosystems. On the other hand, the use of random codes in such cryptosystems is impossible because of the high complexity of its decoding. Strengthening of code cryptosystems is currently conducted, usually, either by using codes for which no attacks are known, or by modifying the cryptographic protocol. In this paper both of these approaches are used. On the one hand, it is proposed to use the tensor product $C^1\otimes C^2$ of the known codes $C^1$ and $C^2$, since for $C^1\otimes C^2$ in some cases it is possible to construct an effective decoding algorithm. On the other hand, instead of a McEliece-type cryptosystem, it is proposed to use its modification, a Berger–Loidreau cryptosystem. The paper proves a high strength of the constructed code cryptosystem to attacks on the key even in the case when code cryptosystems on codes $C^1$ and $C^2$ are cracked.

Keywords: the Berger–Loidreau cryptosystem, the tensor product of codes, the attack on the key.

DOI: https://doi.org/10.14529/jcem180202

Full text: PDF file (186 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 517.9
MSC: 39A60
Received: 25.05.2018
Language:

Citation: V. M. Deundyak, Yu. V. Kosolapov, “On the Berger–Loidreau cryptosystem on the tensor product of codes”, J. Comp. Eng. Math., 5:2 (2018), 16–33

Citation in format AMSBIB
\Bibitem{DeuKos18}
\by V.~M.~Deundyak, Yu.~V.~Kosolapov
\paper On the Berger--Loidreau cryptosystem on the tensor product of codes
\jour J. Comp. Eng. Math.
\yr 2018
\vol 5
\issue 2
\pages 16--33
\mathnet{http://mi.mathnet.ru/jcem116}
\crossref{https://doi.org/10.14529/jcem180202}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3817477}
\elib{http://elibrary.ru/item.asp?id=35221212}


Linking options:
  • http://mi.mathnet.ru/eng/jcem116
  • http://mi.mathnet.ru/eng/jcem/v5/i2/p16

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Journal of Computational and Engineering Mathematics
    Number of views:
    This page:325
    Full text:70
    References:21

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019