Аналіз статистичної безпеки схеми автентифікації на основі vk-послідовностей

Abstract

The paper analyzes the statistical security of authentication of the parties interaction schemes based on recurrent Vk-sequences compared to known authentication scheme Feige-Fiat-Shamir, Fiat-Shamir and Schnorr for key length 1024 bits. The results showed that the scheme on the basis of Vksequences as a whole has a high statistical security, not yielding to known peers, but compared with smaller key lengths, these indicators are higher.