Дослідження можливості використання алгоритму циклічного надлишкового коду для підвищення стійкості криптосхеми ECIES

Abstract

The problem of vulnerability of the asymmetric cryptoscheme ECIES to the small subgroups attack is considered, as well as the possibility of using an algorithm of cyclic redundancy code to increase its cryptostability. A method of checking the public key for authenticity is developed that makes it impossible to conduct a successful small subgroups attack, and as a result significantly increases the theoretical stability of this cryptographic algorithm. The essence of the modification is that when generating a public key, the checksum is automatically calculated for it. After exchanging keys, each user generates a check sum of his own public key. This checksum is added to the optional parameter when calculating the message tag using the MAC function. After receiving the message and verifying its tag, it is concluded that all the parameters that participated in its generation are identical. If the checksums do not coincide as a result of a public key substitution, the message tag will also be changed. In this case, it is concluded that the public key of one of the interlocutors has been changed during the exchange and the continued exchange of information with these public keys is dangerous and need to be replaced. The performed statistical testing of the proposed modification of the algorithm showed good statistical stability, since the results of the tests do not exceed 0.9-1, however, generally, both versions showed almost the same results in tests