Code-based schemes for digital signatures
Journal Title: КОМП’ЮТЕРНІ НАУКИ ТА КІБЕРБЕЗПЕКА - Year 2018, Vol 2, Issue 10
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
- EP ID EP432082
- DOI -
- Views 110
- Downloads 0
Essence and conditions of implementation of the attack based on related keys relatively electronic signatures IBS-1 and IBS-2 DSTU ISO/IEC 14888-3
The paper deals with the state of protection electronic signatures based on the pairing of points of an elliptic curve against attacks based on the signing data with related keys. It is defined conditions and possibiliti...
BLIND ELECTRONIC SIGNATURE MECHANISMS ON ELLIPTIC CURVES IMPROVEMENT
The work is devoted to consideration the blind electronic signature mechanisms based on algorithms, de-scribed in ISO/IEC 14888-3:2006 and national standard DSTU 4145-2002. It is tested protocol security based on these a...
DESCRIPTION AND APPLICATIONS OF BINOMIAL NUMERAL SYSTEMS
We develop a new class of positional numeral systems, namely the binomial ones, which form a subclass of generalized positional numeral systems (GPNS). The binomial systems have wide range of applications in the infor-ma...
ЗАСТОСУВАННЯ КРИПТОАЛГОРИТМІВ В ДЕЦЕНТРАЛІЗОВАНИХ МЕРЕЖАХ ТА ПЕРСПЕКТИВИ ЇХ ЗАМІНИ ДЛЯ ПОСТКВАНТОВОГО ПЕРІОДУ
В роботі проведено огляд використовуваних у блокчейн системах електронних підписів та функцій хешування. Наведено криптографічні алгоритми, які використовуються або можуть використовуватися в децентралізованих мережах. П...
Code-based schemes for digital signatures
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...