Eugenii Krouk

Eugenii Krouk

Auto-generated profile, based on publicly available information

Eugenii Krouk

HSE University, Moscow Institute of Electronics and Mathematics

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
EEElena Egorova
Elena Egorova
GKGrigory Kabatiansky
Grigory Kabatiansky
EKE Krouk
E Krouk
CTC Tavernier
C Tavernier
We propose a new type of public-key cryptosystems (PKC) which is based on repetition of different error-correcting codes. We give a brief analysis of some well known attacks on code-based PKC, including structural ones and show that the scheme could be used as a perspective post-quantum PKC.

1 April 2022 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
VZV. V. Zyablov
V. V. Zyablov
FIFedor Ivanov
Fedor Ivanov
EKE. A. Krouk
E. A. Krouk
Vladimir SidorenkoVladimir Sidorenko
Vladimir Sidorenko
We consider the problem of constructing a cryptosystem with a public key based on error-resistant coding. At present, this type of cryptosystems is believed to be able to resist the advent of quantum computers and can be considered as a method of post-quantum cryptography. The main drawback of a code-based cryptosystem is a great length of the public key. Most papers devoted to reducing the cryptosystem key length consisted in replacing the Goppa codes used in the original cryptosystem with some other codes with a requirement that the system remains secure against attacks by a quantum computer. Here we propose another approach to the key length reduction that is stated as a task of a simple description of an error set which has either errors of weights greater than half the minimum distance or errors that cannot be corrected without an additional secret knowledge. If a code structure allows to give such a description of an error set, then the complexity of most attacks (for instance, information-set decoding) significantly increases.

1 January 2020 in IFAC-PapersOnLine
Verified
Journal Article
Closed access
FIFedor Ivanov
Fedor Ivanov
AKAlexey Kreschuk
Alexey Kreschuk
EKEugenii Krouk
Eugenii Krouk

30 July 2025
Verified
Book Chapter
Closed access
PDF file
ASAnton Sergeev
Anton Sergeev
IPIlya Petrovanov
Ilya Petrovanov
EKEugine Krouk
Eugine Krouk

31 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
FIFedor Ivanov
Fedor Ivanov
EKEugenii Krouk
Eugenii Krouk
McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new general way to reduce the public key size. Unlike most papers on reducing key length of the cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of key size reduction which is code-independent.