z-logo
open-access-imgOpen Access
Development of digital signature algorithm based on the Niederriter crypto-code system
Author(s) -
О.С. Циганенко
Publication year - 2020
Publication title -
sistemi obrobki ìnformacìï
Language(s) - English
Resource type - Journals
eISSN - 2518-1696
pISSN - 1681-7710
DOI - 10.30748/soi.2020.162.09
Subject(s) - computer science , algorithm , digital signature , cryptosystem , mceliece cryptosystem , cryptography , elliptic curve digital signature algorithm , code (set theory) , quantum computer , theoretical computer science , encryption , elliptic curve cryptography , computer security , public key cryptography , quantum , hash function , programming language , physics , set (abstract data type) , quantum mechanics
The development of computing resources in the post-quantum period calls into question the provision of the required level of stability of symmetric and asymmetric cryptography algorithms. The advent of a full-scale quantum computer based on the Shore and Grover algorithms greatly increases the capabilities of cybercriminals and reduces the resilience of cryptosystems used in protocols for basic security services. The article analyzes the main requirements for resistance to post-quantum cryptography algorithms. In such conditions, it is necessary to use modified cryptosystems that provide an integrated required level of stability and efficiency of cryptocurrencies. One such mechanism is the crypto-code constructs of McEliece and Niederriter, which provide the required indicators of durability, efficiency and reliability. The paper analyzes the construction of the crypto-code structure of the Niederriter on elliptical (EC), modified elliptical codes (MEC) shortened and / or extended, and defective codes, practical algorithms for their implementation. An advanced protocol for the formation of a digital signature using Niederriter crypto-code constructions is proposed.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here