Code-based schemes for digital signatures

Abstract

This article is devoted to the features of construction and use of electronic digital signature schemes based on the use of error-correcting codes, namely the most common scheme, which is based on this approach, CFS and the new proposed scheme. A functioning of these schemes directly depends on used code cryptosystem: the first basically contains principles of Niederreiter code cryptosystem, the second involves use of McEliece cryptosystem, which until recently was considered impossible. Algorithms for generating and verifying signatures according to both schemes, described step by step, are considered in detail. The article studies the efficiency of algorithms in terms of volume of required keys and the length of generated signature, the results of which are presented using analytical ratios and in graphical form for specific examples. The resistance of the considered schemes to classical and quantum cryptanalysis was also analyzed, the latter of which is a actual topic in the era of the rapid development of the sphere of post-quantum cryptography. Both schemes have provable resistance to both types of cryptanalysis, but when using quantum computers it is necessary to significantly increase the key lengths, which is a great shortcoming. It has been revealed that the proposed scheme has an indisputable advantage over the used CFS scheme - protection from specific attacks such as a simultaneous replacement of two signature elements and rapid falsification, by adding an additional element to the generated signature. During the study, the advantages, disadvantages and prospects of using the proposed scheme and the CFS scheme in terms of use of quantum computers are highlighted.

Authors and Affiliations

Alexandr Kuznetsov, Anastasia Kiian, Ivan Belozertsev, Mykola Pastukhov, Dmytro Prokopovych-Tkachenko

Keywords

Related Articles

DATA SINGLE-ERROR CORRECTION METHOD OF A RESIDUE CLASS CODE

The method of correction of single errors in the residue class (RC) is considered in this article. The results of analysis of arithmetic code correcting possibilities showed high efficiency of the use of position-indepen...

RESEARCH OF USAGE POSSIBILITY AND POST-QUANTUM ALGORITHMS ADVANTAGES DEPEND ON APPLICATION CONDITIONS

We established the need for comparative analysis and evaluation of the possibility to use asymmetric post-quantum cryptographic mechanisms. In order to compare, a procedure for evaluation was selected based on integral a...

THE DIGITAL METHODS FOR DETECTION OF SELECTIVE SPECTRAL ANALYSIS OF COMPLEX SIGNALS

The shortcomings of application of fast Fourier transformation algorithm at detection of separate tones of a signal are considered. The relevance of application of algebraic methods at demodulation of signals in modern i...

IMPROVED MATHEMATICAL MODEL OF THE POST-QUANTUM ELETRONIC SIGNATURE MECHANISM

In the paper new electronic signature mechanisms which will be urgent in the post-quantum period devel-opment necessity is grounded. The main one time key mechanisms are briefly described. Problems related with Lamport O...

О некоторых особенностях криптографических валют и их роли в современных финансовых системах

В работе представлена аргументация относительно места криптовалют в современной мировой финансовой системе. На основании прямых и косвенных данных показано, что криптовалюта всех видов содержит в себе определенные ри...

Download PDF file
  • EP ID EP432082
  • DOI -
  • Views 123
  • Downloads 0

How To Cite

Alexandr Kuznetsov, Anastasia Kiian, Ivan Belozertsev, Mykola Pastukhov, Dmytro Prokopovych-Tkachenko (2018). Code-based schemes for digital signatures. КОМП’ЮТЕРНІ НАУКИ ТА КІБЕРБЕЗПЕКА, 2(10), 23-31. https://europub.co.uk/articles/-A-432082