Eugenii Krouk
Research Subjects
Eugenii Krouk has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Fedor Ivanov
HSE University, Moscow, Russia
3 shared publications - Alexey Kreshchuk
National Research University,Higher School of Economics, Institute for Information, Transmission Problems,Moscow,Russia
1 shared publication - Anton Sergeev
National Research University Higher School of Economics Moscow Russia
1 shared publication - Cedric Tavernier
THALES Communications
1 shared publication - E. E. Egorova
Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
1 shared publication - Grigory Kabatiansky
Skolkovo Institute of Science and Technology (Skoltech), Moscow, Russia
1 shared publication
Latest Publications
- 1 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (2) , 184-201
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding
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 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (2) , 184-201
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding
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.
- Open Access
New Code-Based Cryptosystem with Arbitrary Error Vectors
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.
Open AccessNew Code-Based Cryptosystem with Arbitrary Error Vectors
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.
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 11108-11113
On the Secret Sharing Scheme Based on Supercodes Decoding
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 11108-11113
On the Secret Sharing Scheme Based on Supercodes Decoding
- Open Access
- 1 February 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1163 (1) , 012061
A new code-based public-key cryptosystem resistant to quantum computer attacks
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 February 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1163 (1) , 012061
Open AccessA new code-based public-key cryptosystem resistant to quantum computer attacks
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.