Code-based key encapsulation mechanisms for post-quantum standardization

Кuznetsov, Alexandr; Lutsenko, Maria; Kiian, Nastya; Makushenko, Tymur; Кузнецова, Тетяна

doi:10.1109/dessert.2018.8409144

Cited by 14 publications

(17 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These results may also be useful in other important practical applications: cryptography, authentication, the theory of complex signals, etc. [14][15][16].…”

Section: Discussionmentioning

confidence: 99%

“…that with i = ξ, it fully complies with the expressions (1-2) for the model with independent errors. To calculate the EGC of (n, k, d)-block code in a channel with grouping errors, it is necessary to fix a required error probability on one character P d and calculate the corresponding value of E/N 0 by expressions (14) and/or (19) (taking into account the introduced redundancy and the multiplier d/n). The difference of γ 2 and γ 1 gives the required estimation of the EGC:…”

Section: No /mentioning

confidence: 99%

See 1 more Smart Citation

Energy Gain From Error-Correcting Coding in Channels With Grouping Errors

2020

Self Cite

View full text Add to dashboard Cite

Abstract. This article explores the a mathematical model of the a data transmission channel with errors grouping. We propose an estimating method for energy gain from coding and energy efficiency of binary codes in channels with grouped errors. The proposed method uses a simplified Bennet and Froelich’s model and allows leading the research of the energy gain from coding for a wide class of data channels without restricting the way of the length distributing the error bursts. The reliability of the obtained results is confirmed by the information of the known results in the theory of error-correcting coding in the simplified variant.

show abstract

“…These results may also be useful in other important practical applications: cryptography, authentication, the theory of complex signals, etc. [14][15][16].…”

Section: Discussionmentioning

confidence: 99%

Section: No /mentioning

confidence: 99%

Energy Gain From Error-Correcting Coding in Channels With Grouping Errors

2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to provide a maximum stability, it is recommended to maximize the Hamming weight of the vector e, because overcoming all possible values of this vector is much more complicated. Decryption in the hybrid scheme occurs, just like in the McEliece scheme described in the previous section, with the only difference that information is extracted not only from the vector I, but also from the error vector e [12][13][14]. This fact allows us to significantly increase the relative speed of information transmission, which will be discussed further.…”

Section: A New Hybrid Cryptosystemmentioning

confidence: 99%

“…An estimation of the relative speed for the McEliece scheme is the simplest, since it is known that any cryptogram formed by this algorithm has the length n, whereas the initial information vector has the length of k bit. Consequently, the relative transmission speed in this case [12][13][14]…”

Section: Relative Speed Of Information Transmissionmentioning

confidence: 99%

“…However, the obvious advantage of the hybrid cryptosystem, which is worth reminding, in terms of cryptosystem's efficiency, is that it allows one to encrypt a larger amount of information using the same number of keys, while providing an adequate level of protection [25][26][27][28][29][30][31]. This research might be useful for the improvement of various methods of information security [10][11][12][13], as well as other practical use [32][33][34][35][36].…”

Section: Comparison Of Key Data and Length Of Ciphertextmentioning

confidence: 99%

See 1 more Smart Citation

Code-Based Hybrid Cryptosystem: Comparative Studies and Analysis of Efficiency

Gorbenko¹,

Кіян²,

Pushkar'ov³

et al. 2019

IJC

Self Cite

View full text Add to dashboard Cite

In this paper the basic principles of construction and operation of McEliece and Niederreiter cryptosystems based on the use of error-correcting codes were considered. A new hybrid cryptosystem that combines the rules of encryption according to the above-mentioned schemes is proposed. Also, this paper presents the analysis and comparative studies from the standpoint of stability, the volume of public and private keys, length of ciphertext and relative speed of information transmission of the new proposed scheme and McEliece and Niederreiter cryptosystems. It is considered from an analytical point of view and with the help of graphic images. Comparative studies revealed that the hybrid cryptosystem retains the positive aspects of its predecessors, as well as allows us to increase the relative transmission rate with the preservation of the stability indicator to the classical and quantum cryptanalysis. One disadvantage is the increase in decoding time by adding information extracted as in Niederreiter scheme, but the increase in this indicator is not critical. Despite the demonstrated benefits, it remains open to all cryptosystems to reduce the amount of the used key data, which, in the case of quantum computers to maintain stability, still needs to be increased once.

show abstract

Representation of Cascade Codes in the Frequency Domain

Кuznetsov

Pushkar'ov

Serhiienko

et al. 2020

Data-Centric Business and Applications

Self Cite

View full text Add to dashboard Cite

The mathematical apparatus of the multidimensional discrete Fourier transform over finite fields is considered. Methods for the description of linear block codes in the frequency domain are investigated. It is shown that, in contrast to iterative codes (code-products), cascade codes in the general case cannot be described in the frequency domain in terms of multidimensional spectra. Analytic expressions are obtained that establish a one-to-one functional correspondence between the spectrum of a sequence over a finite field and the spectra of the corresponding words obtained by limiting this word to a subfield. A general solution of the problem of representation of cascade codes in the frequency domain is obtained, which allows constructing in the frequency domain using computationally efficient algorithms of encoding and decoding, and the derived analytic dependences of components of multidimensional spectra.

show abstract

Code-based key encapsulation mechanisms for post-quantum standardization

Cited by 14 publications

References 22 publications

Energy Gain From Error-Correcting Coding in Channels With Grouping Errors

Energy Gain From Error-Correcting Coding in Channels With Grouping Errors

Code-Based Hybrid Cryptosystem: Comparative Studies and Analysis of Efficiency

Representation of Cascade Codes in the Frequency Domain

Contact Info

Product

Resources

About