000 02070nab a2200301 c 4500
001 vtls000667132
003 RU-ToGU
005 20210922102603.0
007 cr |
008 191010|2019 ru s a eng d
024 7 _a10.17223/20710410/45/4
_2doi
035 _ato000667132
040 _aRU-ToGU
_brus
_cRU-ToGU
100 1 _aKosolapov, Y. V.
_9496312
245 1 0 _aOn the construction of a semantically secure modification of the McEliece cryptosystem
_cY. V. Kosolapov, O. Y. Turchenko
504 _aБиблиогр.: 15 назв.
520 3 _aThe security of currently used asymmetric cryptosystems is based on the problems of discrete logarithm or discrete factorization. These problems can be effectively solved using Shor’s algorithm on quantum computers. An alternative to such cryptosystems can be the McEliece cryptosystem. Its security is based on the problem of decoding a general linear code. In its original form, the McEliece cryptosystem is not semantically secure, from here the problem of constructing a semantically secure cryptosystem of the McEliece type is relevant. In the paper, the goal is to construct a McEliece type cryptosystem that has the IND-CPA property. Further, one can suppose that this system can be used as base cryptosystem for building the McEliece type encryption scheme with the IND-CCA2 property and an efficient information transfer rate.
653 _aMcEliece, криптосистема
653 _aсемантическая безопасность
653 _aасимметричные криптосистемы
655 4 _aстатьи в журналах
_9745982
700 1 _aTurchenko, O. Y.
_9496313
773 0 _tПрикладная дискретная математика
_d2019
_g№ 45. С. 33-43
_x2071-0410
_w0210-48760
852 4 _aRU-ToGU
856 4 _uhttp://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000667132
908 _aстатья
999 _c456393