Development of Algorithms for Accelerated Computation of Elements of Recurrent Sequences for Cryptographic Purposes

It has been presented algorithms for fast computation of elements of recurrent Vk sequences for positive and negative values of the n index of this sequence. For each of these values, it was considered two possible algorithm variants — based both on the binary method, and on the method of decomposin...

Повний опис

Збережено в:
Бібліографічні деталі
Дата:2013
Автор: Iaremchuk, Iu. E.
Формат: Стаття
Мова:Ukrainian
Опубліковано: Інститут проблем реєстрації інформації НАН України 2013
Теми:
Онлайн доступ:http://drsp.ipri.kiev.ua/article/view/103361
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Data Recording, Storage & Processing

Репозитарії

Data Recording, Storage & Processing
Опис
Резюме:It has been presented algorithms for fast computation of elements of recurrent Vk sequences for positive and negative values of the n index of this sequence. For each of these values, it was considered two possible algorithm variants — based both on the binary method, and on the method of decomposing the sequence element index. It has been obtained some complexity evaluations of the presented algorithms showing that the complexity of the Vk sequence computing under the module is approximately at the same level as the corresponding exponentiation, which enables efficient use of recurrent Vk and Uk sequences for various cryptographic purposes. Refs: 8 titles.