|
Mathematics
On some cryptosystems based on algebraic codes
S. M. Ratseeva, O. I. Cherevatenkob, V. A. Chernyavskayab a Ulyanovsk State University, Ulyanovsk, Russian Federation
b Ulyanovsk State University of Education, Ulyanovsk, Russian Federation
(published under the terms of the Creative Commons Attribution 4.0 International License)
Abstract:
In 1978 McEliece built the first public key cryptosystem based on error-correcting codes. At the same time, effective attacks on the secret keys of this cryptosystem have not yet been found. The work describes the classical and modernized cryptosystems of McEliece and Niederreiter, also examples of their practical application based on Goppa codes using the Patterson algorithm. Also the algorithms of two-step authentication protocols with zero disclosure based on error-correcting codes are given.
Keywords:
McEliece cryptosystem, error-correcting codes, Goppa codes, code decoding.
Received: 11.12.2020 Revised: 20.01.2021 Accepted: 28.02.2021
Citation:
S. M. Ratseev, O. I. Cherevatenko, V. A. Chernyavskaya, “On some cryptosystems based on algebraic codes”, Vestnik SamU. Estestvenno-Nauchnaya Ser., 27:1 (2021), 62–73
Linking options:
https://www.mathnet.ru/eng/vsgu647 https://www.mathnet.ru/eng/vsgu/v27/i1/p62
|
Statistics & downloads: |
Abstract page: | 138 | Full-text PDF : | 34 | References: | 19 |
|