Автентифікація сторін взаємодії з обмеженою рандомізацією на основі рекурентних послідовностей

Abstract

The possibility of authentication of the parties interaction with limited randomization based on the mathematical apparatus of recurrence of Vk- and Uk-sequences is considered in the paper. Demonstrated the possibility of reducing (in several times) the computing and communication difficulties during the execution of cryptographic transformations is demonstrated, which is particularly important for systems of the type of "friend or foe", where the reduction of the lifetime of the key due to the lack of randomization of the session key by the applicant is not critical.